./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem18_label56.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 91e42c16ff11f401cb1a0bb363f1df3f27964ca291eb9a5ac2a88f9cc95fa9e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:21:58,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:21:58,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:21:58,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:21:58,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:21:58,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:21:58,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:21:58,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:21:58,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:21:58,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:21:58,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:21:58,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:21:58,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:21:58,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:21:58,732 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:21:58,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:21:58,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:21:58,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:21:58,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:21:58,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:21:58,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:21:58,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:21:58,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:21:58,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:21:58,733 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:21:58,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:21:58,736 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:21:58,736 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:21:58,737 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:21:58,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:21:58,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:21:58,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:21:58,737 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 -> 91e42c16ff11f401cb1a0bb363f1df3f27964ca291eb9a5ac2a88f9cc95fa9e5 [2025-01-09 00:21:58,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:21:58,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:21:58,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:21:58,944 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:21:58,944 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:21:58,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label56.c [2025-01-09 00:22:00,144 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c83779e1d/8807549ee62845a49fc7004b7ed4207b/FLAG33152273a [2025-01-09 00:22:00,556 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:22:00,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label56.c [2025-01-09 00:22:00,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c83779e1d/8807549ee62845a49fc7004b7ed4207b/FLAG33152273a [2025-01-09 00:22:00,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c83779e1d/8807549ee62845a49fc7004b7ed4207b [2025-01-09 00:22:00,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:22:00,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:22:00,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:22:00,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:22:00,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:22:00,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:22:00" (1/1) ... [2025-01-09 00:22:00,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b281dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:00, skipping insertion in model container [2025-01-09 00:22:00,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:22:00" (1/1) ... [2025-01-09 00:22:00,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:22:00,878 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/Problem18_label56.c[5125,5138] [2025-01-09 00:22:01,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:22:01,348 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:22:01,359 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/Problem18_label56.c[5125,5138] [2025-01-09 00:22:01,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:22:01,552 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:22:01,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01 WrapperNode [2025-01-09 00:22:01,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:22:01,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:22:01,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:22:01,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:22:01,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:01,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:01,757 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-01-09 00:22:01,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:22:01,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:22:01,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:22:01,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:22:01,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:01,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:01,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:01,909 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:22:01,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:01,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:01,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:01,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:01,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:02,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:02,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:02,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:22:02,091 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:22:02,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:22:02,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:22:02,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (1/1) ... [2025-01-09 00:22:02,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:22:02,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:22:02,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:22:02,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:22:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:22:02,187 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:22:02,188 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:22:04,675 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-01-09 00:22:04,675 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:22:04,692 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:22:04,692 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:22:04,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:22:04 BoogieIcfgContainer [2025-01-09 00:22:04,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:22:04,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:22:04,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:22:04,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:22:04,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:22:00" (1/3) ... [2025-01-09 00:22:04,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b7c39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:22:04, skipping insertion in model container [2025-01-09 00:22:04,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:01" (2/3) ... [2025-01-09 00:22:04,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b7c39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:22:04, skipping insertion in model container [2025-01-09 00:22:04,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:22:04" (3/3) ... [2025-01-09 00:22:04,699 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label56.c [2025-01-09 00:22:04,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:22:04,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label56.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:22:04,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:22:04,775 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;@7f388550, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:22:04,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:22:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 00:22:04,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:04,788 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] [2025-01-09 00:22:04,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:04,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:04,792 INFO L85 PathProgramCache]: Analyzing trace with hash -480397966, now seen corresponding path program 1 times [2025-01-09 00:22:04,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:04,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322758119] [2025-01-09 00:22:04,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:04,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:04,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 00:22:04,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 00:22:04,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:04,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:22:05,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322758119] [2025-01-09 00:22:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322758119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:05,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:05,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:05,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658188379] [2025-01-09 00:22:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:05,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:22:05,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:05,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:22:05,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:22:05,175 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:09,244 INFO L93 Difference]: Finished difference Result 2900 states and 5644 transitions. [2025-01-09 00:22:09,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:22:09,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 00:22:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:09,262 INFO L225 Difference]: With dead ends: 2900 [2025-01-09 00:22:09,262 INFO L226 Difference]: Without dead ends: 2074 [2025-01-09 00:22:09,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:22:09,268 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 2176 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3368 mSolverCounterSat, 1796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 5164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1796 IncrementalHoareTripleChecker+Valid, 3368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:09,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 160 Invalid, 5164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1796 Valid, 3368 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-09 00:22:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-01-09 00:22:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2025-01-09 00:22:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 1.5561987457790643) internal successors, (3226), 2073 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3226 transitions. [2025-01-09 00:22:09,371 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3226 transitions. Word has length 48 [2025-01-09 00:22:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:09,371 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3226 transitions. [2025-01-09 00:22:09,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3226 transitions. [2025-01-09 00:22:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 00:22:09,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:09,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:22:09,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:22:09,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:09,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:09,380 INFO L85 PathProgramCache]: Analyzing trace with hash 51646611, now seen corresponding path program 1 times [2025-01-09 00:22:09,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:09,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505537013] [2025-01-09 00:22:09,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:09,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:09,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 00:22:09,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 00:22:09,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:09,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 00:22:09,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505537013] [2025-01-09 00:22:09,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505537013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:09,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:09,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:09,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729816716] [2025-01-09 00:22:09,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:09,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:22:09,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:09,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:22:09,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:22:09,991 INFO L87 Difference]: Start difference. First operand 2074 states and 3226 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:13,454 INFO L93 Difference]: Finished difference Result 6906 states and 10879 transitions. [2025-01-09 00:22:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:22:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 225 [2025-01-09 00:22:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:13,466 INFO L225 Difference]: With dead ends: 6906 [2025-01-09 00:22:13,466 INFO L226 Difference]: Without dead ends: 4834 [2025-01-09 00:22:13,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:22:13,469 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1923 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4378 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 4994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 4378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:13,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 647 Invalid, 4994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 4378 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 00:22:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2025-01-09 00:22:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2025-01-09 00:22:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.3376780111030655) internal successors, (5542), 4143 states have internal predecessors, (5542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5542 transitions. [2025-01-09 00:22:13,521 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5542 transitions. Word has length 225 [2025-01-09 00:22:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:13,521 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5542 transitions. [2025-01-09 00:22:13,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5542 transitions. [2025-01-09 00:22:13,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-01-09 00:22:13,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:13,525 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:13,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:22:13,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:13,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash -47631755, now seen corresponding path program 1 times [2025-01-09 00:22:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071900453] [2025-01-09 00:22:13,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:13,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-09 00:22:13,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-09 00:22:13,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:13,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:22:13,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:13,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071900453] [2025-01-09 00:22:13,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071900453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:13,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:13,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897964431] [2025-01-09 00:22:13,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:13,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:22:13,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:13,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:22:13,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:22:13,851 INFO L87 Difference]: Start difference. First operand 4144 states and 5542 transitions. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:15,968 INFO L93 Difference]: Finished difference Result 10409 states and 13835 transitions. [2025-01-09 00:22:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:22:15,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 314 [2025-01-09 00:22:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:15,997 INFO L225 Difference]: With dead ends: 10409 [2025-01-09 00:22:15,997 INFO L226 Difference]: Without dead ends: 6214 [2025-01-09 00:22:16,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:22:16,004 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 529 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 867 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 3457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 867 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:16,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 636 Invalid, 3457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [867 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:22:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2025-01-09 00:22:16,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5524. [2025-01-09 00:22:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.1921057396342567) internal successors, (6584), 5523 states have internal predecessors, (6584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6584 transitions. [2025-01-09 00:22:16,072 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 6584 transitions. Word has length 314 [2025-01-09 00:22:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:16,073 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 6584 transitions. [2025-01-09 00:22:16,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 6584 transitions. [2025-01-09 00:22:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2025-01-09 00:22:16,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:16,089 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:16,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:22:16,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:16,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash 559165254, now seen corresponding path program 1 times [2025-01-09 00:22:16,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:16,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055467216] [2025-01-09 00:22:16,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:16,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:16,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 946 statements into 1 equivalence classes. [2025-01-09 00:22:16,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 946 of 946 statements. [2025-01-09 00:22:16,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:16,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 00:22:16,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:16,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055467216] [2025-01-09 00:22:16,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055467216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:16,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:16,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:22:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710060069] [2025-01-09 00:22:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:16,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:16,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:16,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:16,761 INFO L87 Difference]: Start difference. First operand 5524 states and 6584 transitions. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 2 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:18,495 INFO L93 Difference]: Finished difference Result 13116 states and 16143 transitions. [2025-01-09 00:22:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:18,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 2 states have internal predecessors, (566), 0 states have call successors, (0), 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 946 [2025-01-09 00:22:18,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:18,520 INFO L225 Difference]: With dead ends: 13116 [2025-01-09 00:22:18,520 INFO L226 Difference]: Without dead ends: 7594 [2025-01-09 00:22:18,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:18,527 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 227 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:18,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 388 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:22:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2025-01-09 00:22:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 6904. [2025-01-09 00:22:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.1752861074894974) internal successors, (8113), 6903 states have internal predecessors, (8113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8113 transitions. [2025-01-09 00:22:18,610 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8113 transitions. Word has length 946 [2025-01-09 00:22:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:18,613 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8113 transitions. [2025-01-09 00:22:18,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 2 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8113 transitions. [2025-01-09 00:22:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1015 [2025-01-09 00:22:18,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:18,637 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:18,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:22:18,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:18,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash 408737962, now seen corresponding path program 1 times [2025-01-09 00:22:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:18,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385802994] [2025-01-09 00:22:18,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:18,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:18,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1014 statements into 1 equivalence classes. [2025-01-09 00:22:18,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1014 of 1014 statements. [2025-01-09 00:22:18,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:18,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2025-01-09 00:22:19,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:19,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385802994] [2025-01-09 00:22:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385802994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:19,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:19,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:22:19,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227064205] [2025-01-09 00:22:19,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:19,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:19,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:19,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:19,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:19,361 INFO L87 Difference]: Start difference. First operand 6904 states and 8113 transitions. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 2 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:21,533 INFO L93 Difference]: Finished difference Result 15876 states and 18741 transitions. [2025-01-09 00:22:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:21,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 2 states have internal predecessors, (605), 0 states have call successors, (0), 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 1014 [2025-01-09 00:22:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:21,561 INFO L225 Difference]: With dead ends: 15876 [2025-01-09 00:22:21,564 INFO L226 Difference]: Without dead ends: 8974 [2025-01-09 00:22:21,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:21,571 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:21,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 77 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:22:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8974 states. [2025-01-09 00:22:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8974 to 8974. [2025-01-09 00:22:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8973 states have (on average 1.1618187897024406) internal successors, (10425), 8973 states have internal predecessors, (10425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 10425 transitions. [2025-01-09 00:22:21,669 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 10425 transitions. Word has length 1014 [2025-01-09 00:22:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:21,670 INFO L471 AbstractCegarLoop]: Abstraction has 8974 states and 10425 transitions. [2025-01-09 00:22:21,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 2 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 10425 transitions. [2025-01-09 00:22:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2025-01-09 00:22:21,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:21,679 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:21,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:22:21,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:21,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash -742952019, now seen corresponding path program 1 times [2025-01-09 00:22:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:21,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057026159] [2025-01-09 00:22:21,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:21,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1064 statements into 1 equivalence classes. [2025-01-09 00:22:21,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1064 of 1064 statements. [2025-01-09 00:22:21,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:21,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-01-09 00:22:22,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:22,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057026159] [2025-01-09 00:22:22,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057026159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:22,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:22,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359578315] [2025-01-09 00:22:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:22,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:22,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:22,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:22,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:22,752 INFO L87 Difference]: Start difference. First operand 8974 states and 10425 transitions. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:24,461 INFO L93 Difference]: Finished difference Result 24156 states and 28454 transitions. [2025-01-09 00:22:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:24,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 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 1064 [2025-01-09 00:22:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:24,490 INFO L225 Difference]: With dead ends: 24156 [2025-01-09 00:22:24,490 INFO L226 Difference]: Without dead ends: 15184 [2025-01-09 00:22:24,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:24,499 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 576 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:24,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1005 Invalid, 2325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:22:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15184 states. [2025-01-09 00:22:24,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 15184. [2025-01-09 00:22:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15184 states, 15183 states have (on average 1.1337680300335902) internal successors, (17214), 15183 states have internal predecessors, (17214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15184 states to 15184 states and 17214 transitions. [2025-01-09 00:22:24,726 INFO L78 Accepts]: Start accepts. Automaton has 15184 states and 17214 transitions. Word has length 1064 [2025-01-09 00:22:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:24,727 INFO L471 AbstractCegarLoop]: Abstraction has 15184 states and 17214 transitions. [2025-01-09 00:22:24,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 15184 states and 17214 transitions. [2025-01-09 00:22:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1101 [2025-01-09 00:22:24,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:24,736 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:24,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:22:24,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:24,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1359223265, now seen corresponding path program 1 times [2025-01-09 00:22:24,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:24,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336198222] [2025-01-09 00:22:24,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:24,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:24,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1100 statements into 1 equivalence classes. [2025-01-09 00:22:24,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1100 of 1100 statements. [2025-01-09 00:22:24,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:24,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 574 proven. 578 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 00:22:26,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336198222] [2025-01-09 00:22:26,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336198222] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:22:26,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99392128] [2025-01-09 00:22:26,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:26,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:22:26,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:22:26,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:22:26,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:22:26,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1100 statements into 1 equivalence classes. [2025-01-09 00:22:26,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1100 of 1100 statements. [2025-01-09 00:22:26,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:26,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:26,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:22:26,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:22:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 548 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2025-01-09 00:22:26,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:22:26,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99392128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:26,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:22:26,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:22:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399116503] [2025-01-09 00:22:26,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:26,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:26,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:26,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:26,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:22:26,476 INFO L87 Difference]: Start difference. First operand 15184 states and 17214 transitions. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:28,269 INFO L93 Difference]: Finished difference Result 34506 states and 39752 transitions. [2025-01-09 00:22:28,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:28,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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 1100 [2025-01-09 00:22:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:28,292 INFO L225 Difference]: With dead ends: 34506 [2025-01-09 00:22:28,293 INFO L226 Difference]: Without dead ends: 19324 [2025-01-09 00:22:28,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1106 GetRequests, 1100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:22:28,306 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 697 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:28,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 212 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:22:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19324 states. [2025-01-09 00:22:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19324 to 19324. [2025-01-09 00:22:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19324 states, 19323 states have (on average 1.1331056254204834) internal successors, (21895), 19323 states have internal predecessors, (21895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19324 states to 19324 states and 21895 transitions. [2025-01-09 00:22:28,567 INFO L78 Accepts]: Start accepts. Automaton has 19324 states and 21895 transitions. Word has length 1100 [2025-01-09 00:22:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:28,568 INFO L471 AbstractCegarLoop]: Abstraction has 19324 states and 21895 transitions. [2025-01-09 00:22:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 19324 states and 21895 transitions. [2025-01-09 00:22:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2025-01-09 00:22:28,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:28,578 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:28,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 00:22:28,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:22:28,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:28,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1405382640, now seen corresponding path program 1 times [2025-01-09 00:22:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22997526] [2025-01-09 00:22:28,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:28,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1141 statements into 1 equivalence classes. [2025-01-09 00:22:28,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1141 of 1141 statements. [2025-01-09 00:22:28,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:28,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 713 proven. 0 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2025-01-09 00:22:29,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:29,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22997526] [2025-01-09 00:22:29,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22997526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:29,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:29,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:29,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022274390] [2025-01-09 00:22:29,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:29,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:29,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:29,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:29,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:29,203 INFO L87 Difference]: Start difference. First operand 19324 states and 21895 transitions. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:30,881 INFO L93 Difference]: Finished difference Result 44856 states and 50830 transitions. [2025-01-09 00:22:30,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 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 1141 [2025-01-09 00:22:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:30,937 INFO L225 Difference]: With dead ends: 44856 [2025-01-09 00:22:30,937 INFO L226 Difference]: Without dead ends: 22774 [2025-01-09 00:22:30,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:30,953 INFO L435 NwaCegarLoop]: 1088 mSDtfsCounter, 638 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:30,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1095 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:22:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22774 states. [2025-01-09 00:22:31,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22774 to 22084. [2025-01-09 00:22:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22084 states, 22083 states have (on average 1.0762124711316396) internal successors, (23766), 22083 states have internal predecessors, (23766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22084 states to 22084 states and 23766 transitions. [2025-01-09 00:22:31,101 INFO L78 Accepts]: Start accepts. Automaton has 22084 states and 23766 transitions. Word has length 1141 [2025-01-09 00:22:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:31,103 INFO L471 AbstractCegarLoop]: Abstraction has 22084 states and 23766 transitions. [2025-01-09 00:22:31,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 22084 states and 23766 transitions. [2025-01-09 00:22:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1150 [2025-01-09 00:22:31,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:31,113 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:31,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:22:31,114 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:31,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:31,114 INFO L85 PathProgramCache]: Analyzing trace with hash 852807456, now seen corresponding path program 1 times [2025-01-09 00:22:31,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:31,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046386579] [2025-01-09 00:22:31,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:31,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:31,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1149 statements into 1 equivalence classes. [2025-01-09 00:22:31,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1149 of 1149 statements. [2025-01-09 00:22:31,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:31,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1320 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 1091 trivial. 0 not checked. [2025-01-09 00:22:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046386579] [2025-01-09 00:22:31,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046386579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:31,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:31,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:31,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840521548] [2025-01-09 00:22:31,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:31,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:31,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:31,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:31,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:31,665 INFO L87 Difference]: Start difference. First operand 22084 states and 23766 transitions. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:33,336 INFO L93 Difference]: Finished difference Result 51756 states and 56147 transitions. [2025-01-09 00:22:33,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:33,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 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 1149 [2025-01-09 00:22:33,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:33,395 INFO L225 Difference]: With dead ends: 51756 [2025-01-09 00:22:33,396 INFO L226 Difference]: Without dead ends: 29674 [2025-01-09 00:22:33,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:33,419 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 649 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:33,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 936 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:22:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29674 states. [2025-01-09 00:22:33,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29674 to 28984. [2025-01-09 00:22:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28984 states, 28983 states have (on average 1.0725252734361523) internal successors, (31085), 28983 states have internal predecessors, (31085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28984 states to 28984 states and 31085 transitions. [2025-01-09 00:22:33,730 INFO L78 Accepts]: Start accepts. Automaton has 28984 states and 31085 transitions. Word has length 1149 [2025-01-09 00:22:33,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:33,731 INFO L471 AbstractCegarLoop]: Abstraction has 28984 states and 31085 transitions. [2025-01-09 00:22:33,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 28984 states and 31085 transitions. [2025-01-09 00:22:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1197 [2025-01-09 00:22:33,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:33,751 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:33,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:22:33,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:33,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1618109667, now seen corresponding path program 1 times [2025-01-09 00:22:33,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:33,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427369630] [2025-01-09 00:22:33,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:33,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1196 statements into 1 equivalence classes. [2025-01-09 00:22:33,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1196 of 1196 statements. [2025-01-09 00:22:33,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:33,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2025-01-09 00:22:34,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:34,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427369630] [2025-01-09 00:22:34,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427369630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:34,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:34,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:34,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636044820] [2025-01-09 00:22:34,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:34,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:34,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:34,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:34,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:34,420 INFO L87 Difference]: Start difference. First operand 28984 states and 31085 transitions. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:36,153 INFO L93 Difference]: Finished difference Result 65556 states and 70709 transitions. [2025-01-09 00:22:36,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:36,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 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 1196 [2025-01-09 00:22:36,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:36,230 INFO L225 Difference]: With dead ends: 65556 [2025-01-09 00:22:36,230 INFO L226 Difference]: Without dead ends: 36574 [2025-01-09 00:22:36,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:36,276 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 649 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:36,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 285 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1810 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:22:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36574 states. [2025-01-09 00:22:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36574 to 35884. [2025-01-09 00:22:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35884 states, 35883 states have (on average 1.0683889306914138) internal successors, (38337), 35883 states have internal predecessors, (38337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35884 states to 35884 states and 38337 transitions. [2025-01-09 00:22:36,599 INFO L78 Accepts]: Start accepts. Automaton has 35884 states and 38337 transitions. Word has length 1196 [2025-01-09 00:22:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:36,600 INFO L471 AbstractCegarLoop]: Abstraction has 35884 states and 38337 transitions. [2025-01-09 00:22:36,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 35884 states and 38337 transitions. [2025-01-09 00:22:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2025-01-09 00:22:36,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:36,612 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:36,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:22:36,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:36,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:36,613 INFO L85 PathProgramCache]: Analyzing trace with hash -926212112, now seen corresponding path program 1 times [2025-01-09 00:22:36,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:36,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566057497] [2025-01-09 00:22:36,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:36,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:36,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1222 statements into 1 equivalence classes. [2025-01-09 00:22:36,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1222 of 1222 statements. [2025-01-09 00:22:36,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:36,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1466 backedges. 794 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2025-01-09 00:22:37,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:37,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566057497] [2025-01-09 00:22:37,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566057497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:37,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:37,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:37,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679007035] [2025-01-09 00:22:37,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:37,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:37,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:37,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:37,161 INFO L87 Difference]: Start difference. First operand 35884 states and 38337 transitions. Second operand has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:38,789 INFO L93 Difference]: Finished difference Result 80736 states and 86348 transitions. [2025-01-09 00:22:38,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:38,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 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 1222 [2025-01-09 00:22:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:38,832 INFO L225 Difference]: With dead ends: 80736 [2025-01-09 00:22:38,832 INFO L226 Difference]: Without dead ends: 41404 [2025-01-09 00:22:38,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:38,856 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 502 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:38,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 939 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:22:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41404 states. [2025-01-09 00:22:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41404 to 40714. [2025-01-09 00:22:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40714 states, 40713 states have (on average 1.0624124972367548) internal successors, (43254), 40713 states have internal predecessors, (43254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40714 states to 40714 states and 43254 transitions. [2025-01-09 00:22:39,134 INFO L78 Accepts]: Start accepts. Automaton has 40714 states and 43254 transitions. Word has length 1222 [2025-01-09 00:22:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:39,134 INFO L471 AbstractCegarLoop]: Abstraction has 40714 states and 43254 transitions. [2025-01-09 00:22:39,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 40714 states and 43254 transitions. [2025-01-09 00:22:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1238 [2025-01-09 00:22:39,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:39,146 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:39,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:22:39,147 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:39,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:39,147 INFO L85 PathProgramCache]: Analyzing trace with hash -99938548, now seen corresponding path program 1 times [2025-01-09 00:22:39,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:39,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317780988] [2025-01-09 00:22:39,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:39,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:39,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1237 statements into 1 equivalence classes. [2025-01-09 00:22:39,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1237 of 1237 statements. [2025-01-09 00:22:39,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:39,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 807 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-01-09 00:22:39,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:39,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317780988] [2025-01-09 00:22:39,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317780988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:39,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:39,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:39,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871027202] [2025-01-09 00:22:39,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:39,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:39,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:39,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:39,699 INFO L87 Difference]: Start difference. First operand 40714 states and 43254 transitions. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:41,309 INFO L93 Difference]: Finished difference Result 90396 states and 96630 transitions. [2025-01-09 00:22:41,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:41,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 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 1237 [2025-01-09 00:22:41,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:41,355 INFO L225 Difference]: With dead ends: 90396 [2025-01-09 00:22:41,356 INFO L226 Difference]: Without dead ends: 50374 [2025-01-09 00:22:41,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:41,385 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 490 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:41,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 964 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:22:41,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50374 states. [2025-01-09 00:22:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50374 to 50374. [2025-01-09 00:22:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50374 states, 50373 states have (on average 1.0601512715145018) internal successors, (53403), 50373 states have internal predecessors, (53403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50374 states to 50374 states and 53403 transitions. [2025-01-09 00:22:41,747 INFO L78 Accepts]: Start accepts. Automaton has 50374 states and 53403 transitions. Word has length 1237 [2025-01-09 00:22:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:41,747 INFO L471 AbstractCegarLoop]: Abstraction has 50374 states and 53403 transitions. [2025-01-09 00:22:41,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 50374 states and 53403 transitions. [2025-01-09 00:22:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2025-01-09 00:22:41,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:41,762 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:22:41,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:41,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash -748599243, now seen corresponding path program 1 times [2025-01-09 00:22:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125385184] [2025-01-09 00:22:41,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:41,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:41,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1305 statements into 1 equivalence classes. [2025-01-09 00:22:41,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1305 of 1305 statements. [2025-01-09 00:22:41,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:41,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2025-01-09 00:22:43,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:43,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125385184] [2025-01-09 00:22:43,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125385184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:43,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:43,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:43,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145212166] [2025-01-09 00:22:43,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:43,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:43,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:43,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:43,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:43,215 INFO L87 Difference]: Start difference. First operand 50374 states and 53403 transitions. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:44,794 INFO L93 Difference]: Finished difference Result 100056 states and 106113 transitions. [2025-01-09 00:22:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 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 1305 [2025-01-09 00:22:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:44,840 INFO L225 Difference]: With dead ends: 100056 [2025-01-09 00:22:44,840 INFO L226 Difference]: Without dead ends: 50374 [2025-01-09 00:22:44,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:44,868 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 748 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:44,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 746 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:22:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50374 states. [2025-01-09 00:22:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50374 to 50374. [2025-01-09 00:22:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50374 states, 50373 states have (on average 1.0535008834097632) internal successors, (53068), 50373 states have internal predecessors, (53068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50374 states to 50374 states and 53068 transitions. [2025-01-09 00:22:45,342 INFO L78 Accepts]: Start accepts. Automaton has 50374 states and 53068 transitions. Word has length 1305 [2025-01-09 00:22:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:45,342 INFO L471 AbstractCegarLoop]: Abstraction has 50374 states and 53068 transitions. [2025-01-09 00:22:45,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 50374 states and 53068 transitions. [2025-01-09 00:22:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2025-01-09 00:22:45,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:45,361 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:45,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:22:45,362 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:45,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 322924745, now seen corresponding path program 1 times [2025-01-09 00:22:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541520392] [2025-01-09 00:22:45,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:45,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1385 statements into 1 equivalence classes. [2025-01-09 00:22:45,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1385 of 1385 statements. [2025-01-09 00:22:45,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:45,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2229 backedges. 1486 proven. 0 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2025-01-09 00:22:46,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:46,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541520392] [2025-01-09 00:22:46,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541520392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:46,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:46,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:46,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532694774] [2025-01-09 00:22:46,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:46,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:22:46,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:46,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:22:46,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:22:46,214 INFO L87 Difference]: Start difference. First operand 50374 states and 53068 transitions. Second operand has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:48,328 INFO L93 Difference]: Finished difference Result 100746 states and 106148 transitions. [2025-01-09 00:22:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:22:48,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 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 1385 [2025-01-09 00:22:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:48,371 INFO L225 Difference]: With dead ends: 100746 [2025-01-09 00:22:48,371 INFO L226 Difference]: Without dead ends: 51064 [2025-01-09 00:22:48,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:22:48,398 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 799 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2722 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 2722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:48,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 91 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 2722 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:22:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51064 states. [2025-01-09 00:22:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51064 to 50374. [2025-01-09 00:22:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50374 states, 50373 states have (on average 1.0533619200762314) internal successors, (53061), 50373 states have internal predecessors, (53061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50374 states to 50374 states and 53061 transitions. [2025-01-09 00:22:48,763 INFO L78 Accepts]: Start accepts. Automaton has 50374 states and 53061 transitions. Word has length 1385 [2025-01-09 00:22:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:48,764 INFO L471 AbstractCegarLoop]: Abstraction has 50374 states and 53061 transitions. [2025-01-09 00:22:48,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 50374 states and 53061 transitions. [2025-01-09 00:22:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1465 [2025-01-09 00:22:48,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:48,784 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:48,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:22:48,785 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:48,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:48,785 INFO L85 PathProgramCache]: Analyzing trace with hash 31506620, now seen corresponding path program 1 times [2025-01-09 00:22:48,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:48,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242454750] [2025-01-09 00:22:48,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:48,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1464 statements into 1 equivalence classes. [2025-01-09 00:22:48,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1464 of 1464 statements. [2025-01-09 00:22:48,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:48,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2781 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-01-09 00:22:50,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:50,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242454750] [2025-01-09 00:22:50,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242454750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:50,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:50,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:50,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764809255] [2025-01-09 00:22:50,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:50,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:50,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:50,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:50,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:50,127 INFO L87 Difference]: Start difference. First operand 50374 states and 53061 transitions. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:51,879 INFO L93 Difference]: Finished difference Result 100746 states and 106133 transitions. [2025-01-09 00:22:51,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:51,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 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 1464 [2025-01-09 00:22:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:51,926 INFO L225 Difference]: With dead ends: 100746 [2025-01-09 00:22:51,926 INFO L226 Difference]: Without dead ends: 50374 [2025-01-09 00:22:51,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:51,952 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 645 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:51,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 758 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:22:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50374 states. [2025-01-09 00:22:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50374 to 49684. [2025-01-09 00:22:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49684 states, 49683 states have (on average 1.0480244751725942) internal successors, (52069), 49683 states have internal predecessors, (52069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49684 states to 49684 states and 52069 transitions. [2025-01-09 00:22:52,328 INFO L78 Accepts]: Start accepts. Automaton has 49684 states and 52069 transitions. Word has length 1464 [2025-01-09 00:22:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:52,329 INFO L471 AbstractCegarLoop]: Abstraction has 49684 states and 52069 transitions. [2025-01-09 00:22:52,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 49684 states and 52069 transitions. [2025-01-09 00:22:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1519 [2025-01-09 00:22:52,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:52,351 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:52,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:22:52,351 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:52,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:52,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2118423670, now seen corresponding path program 1 times [2025-01-09 00:22:52,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:52,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408401827] [2025-01-09 00:22:52,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:52,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:52,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1518 statements into 1 equivalence classes. [2025-01-09 00:22:52,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1518 of 1518 statements. [2025-01-09 00:22:52,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:52,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3253 backedges. 1708 proven. 0 refuted. 0 times theorem prover too weak. 1545 trivial. 0 not checked. [2025-01-09 00:22:53,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:53,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408401827] [2025-01-09 00:22:53,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408401827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:53,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:53,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:53,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840718643] [2025-01-09 00:22:53,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:53,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:53,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:53,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:53,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:53,261 INFO L87 Difference]: Start difference. First operand 49684 states and 52069 transitions. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:55,036 INFO L93 Difference]: Finished difference Result 98674 states and 103444 transitions. [2025-01-09 00:22:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:55,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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 1518 [2025-01-09 00:22:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:55,037 INFO L225 Difference]: With dead ends: 98674 [2025-01-09 00:22:55,038 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:22:55,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:55,070 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 625 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:55,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 945 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:22:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:22:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:22:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:22:55,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1518 [2025-01-09 00:22:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:55,071 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:22:55,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:22:55,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:22:55,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:22:55,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:22:55,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:55,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:22:56,000 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:22:56,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:22:56 BoogieIcfgContainer [2025-01-09 00:22:56,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:22:56,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:22:56,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:22:56,036 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:22:56,037 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:22:04" (3/4) ... [2025-01-09 00:22:56,054 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:22:56,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 00:22:56,132 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:22:56,140 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:22:56,147 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:22:56,440 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:22:56,440 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:22:56,440 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:22:56,441 INFO L158 Benchmark]: Toolchain (without parser) took 55844.64ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 103.0MB in the beginning and 320.9MB in the end (delta: -217.9MB). Peak memory consumption was 229.5MB. Max. memory is 16.1GB. [2025-01-09 00:22:56,441 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:22:56,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 956.60ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 58.0MB in the end (delta: 45.0MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2025-01-09 00:22:56,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 203.59ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 68.3MB in the end (delta: -10.4MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2025-01-09 00:22:56,442 INFO L158 Benchmark]: Boogie Preprocessor took 332.01ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 68.3MB in the beginning and 270.7MB in the end (delta: -202.3MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2025-01-09 00:22:56,442 INFO L158 Benchmark]: RCFGBuilder took 2601.91ms. Allocated memory is still 343.9MB. Free memory was 270.7MB in the beginning and 94.7MB in the end (delta: 176.0MB). Peak memory consumption was 183.9MB. Max. memory is 16.1GB. [2025-01-09 00:22:56,442 INFO L158 Benchmark]: TraceAbstraction took 51340.97ms. Allocated memory was 343.9MB in the beginning and 587.2MB in the end (delta: 243.3MB). Free memory was 94.7MB in the beginning and 366.9MB in the end (delta: -272.2MB). Peak memory consumption was 983.8MB. Max. memory is 16.1GB. [2025-01-09 00:22:56,442 INFO L158 Benchmark]: Witness Printer took 404.48ms. Allocated memory is still 587.2MB. Free memory was 366.9MB in the beginning and 320.9MB in the end (delta: 46.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 00:22:56,443 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 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 956.60ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 58.0MB in the end (delta: 45.0MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 203.59ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 68.3MB in the end (delta: -10.4MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 332.01ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 68.3MB in the beginning and 270.7MB in the end (delta: -202.3MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2601.91ms. Allocated memory is still 343.9MB. Free memory was 270.7MB in the beginning and 94.7MB in the end (delta: 176.0MB). Peak memory consumption was 183.9MB. Max. memory is 16.1GB. * TraceAbstraction took 51340.97ms. Allocated memory was 343.9MB in the beginning and 587.2MB in the end (delta: 243.3MB). Free memory was 94.7MB in the beginning and 366.9MB in the end (delta: -272.2MB). Peak memory consumption was 983.8MB. Max. memory is 16.1GB. * Witness Printer took 404.48ms. Allocated memory is still 587.2MB. Free memory was 366.9MB in the beginning and 320.9MB in the end (delta: 46.0MB). Peak memory consumption was 41.9MB. 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: 163]: 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, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.3s, OverallIterations: 16, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 33.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12122 SdHoareTripleChecker+Valid, 30.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12122 mSDsluCounter, 9884 SdHoareTripleChecker+Invalid, 25.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 7725 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34182 IncrementalHoareTripleChecker+Invalid, 41907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7725 mSolverCounterUnsat, 9752 mSDtfsCounter, 34182 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1159 GetRequests, 1132 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50374occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 6210 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 17428 NumberOfCodeBlocks, 17428 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 17411 ConstructedInterpolants, 0 QuantifiedInterpolants, 35930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1288 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 21134/21712 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: 4269]: Loop Invariant Derived loop invariant: (((((((((((((a24 <= 3) && (a18 == 9)) || ((a18 == 11) && (a24 <= 3))) || (((a15 != 4) && (a18 == 10)) && (a24 <= 3))) || ((a24 == 0) && (a15 <= 4))) || (((a18 == 12) && (a15 <= 5)) && (a24 != 2))) || ((a18 == 8) && (a24 <= 3))) || (((a15 != 4) && (a24 <= 3)) && (a18 == 12))) || (((a18 == 10) && (a15 <= 5)) && (a24 != 2))) || ((a18 == 11) && (a15 <= 5))) || ((a24 == 1) && (a15 <= 4))) || ((a18 == 8) && (a15 <= 5))) || ((a15 <= 4) && (a18 == 9))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:22:56,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE