./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label12.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/Problem19_label12.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 20f7f4a3a6862c562e99af02cf6b3b1c1c648079a54dedf8628415d0c9277930 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:23:42,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:23:42,667 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:23:42,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:23:42,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:23:42,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:23:42,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:23:42,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:23:42,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:23:42,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:23:42,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:23:42,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:23:42,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:23:42,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:23:42,701 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:23:42,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:23:42,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:23:42,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:23:42,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:23:42,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:23:42,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:23:42,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:23:42,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:23:42,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:23:42,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:23:42,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:23:42,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:23:42,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:23:42,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:23:42,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:23:42,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:23:42,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:23:42,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:23:42,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:23:42,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:23:42,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:23:42,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:23:42,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:23:42,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:23:42,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:23:42,705 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:23:42,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:23:42,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:23:42,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:23:42,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:23:42,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:23:42,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:23:42,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:23:42,706 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 -> 20f7f4a3a6862c562e99af02cf6b3b1c1c648079a54dedf8628415d0c9277930 [2025-01-09 00:23:42,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:23:43,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:23:43,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:23:43,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:23:43,016 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:23:43,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label12.c [2025-01-09 00:23:44,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5af892e63/5908e88c0f8d43d4bb1689c2ddc3ba79/FLAG66965bff2 [2025-01-09 00:23:44,876 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:23:44,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label12.c [2025-01-09 00:23:44,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5af892e63/5908e88c0f8d43d4bb1689c2ddc3ba79/FLAG66965bff2 [2025-01-09 00:23:44,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5af892e63/5908e88c0f8d43d4bb1689c2ddc3ba79 [2025-01-09 00:23:44,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:23:44,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:23:44,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:23:44,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:23:44,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:23:44,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:23:44" (1/1) ... [2025-01-09 00:23:44,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8a98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:44, skipping insertion in model container [2025-01-09 00:23:44,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:23:44" (1/1) ... [2025-01-09 00:23:45,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:23:45,384 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/Problem19_label12.c[5900,5913] [2025-01-09 00:23:46,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:23:46,317 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:23:46,339 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/Problem19_label12.c[5900,5913] [2025-01-09 00:23:47,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:23:47,051 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:23:47,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47 WrapperNode [2025-01-09 00:23:47,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:23:47,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:23:47,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:23:47,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:23:47,061 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:23:47" (1/1) ... [2025-01-09 00:23:47,134 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:23:47" (1/1) ... [2025-01-09 00:23:47,964 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-01-09 00:23:47,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:23:47,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:23:47,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:23:47,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:23:47,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (1/1) ... [2025-01-09 00:23:47,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (1/1) ... [2025-01-09 00:23:48,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (1/1) ... [2025-01-09 00:23:48,489 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:23:48,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (1/1) ... [2025-01-09 00:23:48,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (1/1) ... [2025-01-09 00:23:48,697 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (1/1) ... [2025-01-09 00:23:48,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (1/1) ... [2025-01-09 00:23:48,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (1/1) ... [2025-01-09 00:23:48,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (1/1) ... [2025-01-09 00:23:48,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (1/1) ... [2025-01-09 00:23:49,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:23:49,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:23:49,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:23:49,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:23:49,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (1/1) ... [2025-01-09 00:23:49,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:23:49,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:23:49,064 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:23:49,067 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:23:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:23:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:23:49,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:23:49,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:23:49,164 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:23:49,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:23:56,738 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-01-09 00:23:56,738 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:23:56,793 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:23:56,794 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:23:56,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:23:56 BoogieIcfgContainer [2025-01-09 00:23:56,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:23:56,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:23:56,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:23:56,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:23:56,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:23:44" (1/3) ... [2025-01-09 00:23:56,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413971d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:23:56, skipping insertion in model container [2025-01-09 00:23:56,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:47" (2/3) ... [2025-01-09 00:23:56,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413971d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:23:56, skipping insertion in model container [2025-01-09 00:23:56,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:23:56" (3/3) ... [2025-01-09 00:23:56,805 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label12.c [2025-01-09 00:23:56,819 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:23:56,821 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label12.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:23:56,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:23:56,930 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;@6528656a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:23:56,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:23:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 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:23:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 00:23:56,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:23:56,947 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] [2025-01-09 00:23:56,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:23:56,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:23:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash -730872606, now seen corresponding path program 1 times [2025-01-09 00:23:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:23:56,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321005591] [2025-01-09 00:23:56,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:23:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:23:57,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 00:23:57,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 00:23:57,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:23:57,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:23:57,316 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:23:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:23:57,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321005591] [2025-01-09 00:23:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321005591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:23:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:23:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:23:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664607272] [2025-01-09 00:23:57,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:23:57,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:23:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:23:57,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:23:57,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:57,348 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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:24:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:03,672 INFO L93 Difference]: Finished difference Result 4975 states and 9413 transitions. [2025-01-09 00:24:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 00:24:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:03,702 INFO L225 Difference]: With dead ends: 4975 [2025-01-09 00:24:03,702 INFO L226 Difference]: Without dead ends: 3163 [2025-01-09 00:24:03,710 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:24:03,712 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 1502 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4670 mSolverCounterSat, 1123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 5793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 4670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:03,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1525 Invalid, 5793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 4670 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-01-09 00:24:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2025-01-09 00:24:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3123. [2025-01-09 00:24:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 3122 states have (on average 1.6268417680973735) internal successors, (5079), 3122 states have internal predecessors, (5079), 0 states have call successors, (0), 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:24:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 5079 transitions. [2025-01-09 00:24:03,892 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 5079 transitions. Word has length 44 [2025-01-09 00:24:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:03,893 INFO L471 AbstractCegarLoop]: Abstraction has 3123 states and 5079 transitions. [2025-01-09 00:24:03,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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:24:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 5079 transitions. [2025-01-09 00:24:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 00:24:03,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:03,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:03,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:24:03,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:03,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1769017832, now seen corresponding path program 1 times [2025-01-09 00:24:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008029922] [2025-01-09 00:24:03,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:03,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:03,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 00:24:03,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 00:24:03,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:03,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:04,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:04,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008029922] [2025-01-09 00:24:04,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008029922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:04,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:04,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:24:04,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559991650] [2025-01-09 00:24:04,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:04,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:04,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:04,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:04,200 INFO L87 Difference]: Start difference. First operand 3123 states and 5079 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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:24:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:10,473 INFO L93 Difference]: Finished difference Result 9053 states and 14813 transitions. [2025-01-09 00:24:10,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:10,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-01-09 00:24:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:10,501 INFO L225 Difference]: With dead ends: 9053 [2025-01-09 00:24:10,502 INFO L226 Difference]: Without dead ends: 5932 [2025-01-09 00:24:10,509 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:24:10,510 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 1534 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 1473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 5738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1473 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:10,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1548 Invalid, 5738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1473 Valid, 4265 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-01-09 00:24:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5932 states. [2025-01-09 00:24:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5932 to 5910. [2025-01-09 00:24:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5910 states, 5909 states have (on average 1.423421898798443) internal successors, (8411), 5909 states have internal predecessors, (8411), 0 states have call successors, (0), 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:24:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5910 states to 5910 states and 8411 transitions. [2025-01-09 00:24:10,640 INFO L78 Accepts]: Start accepts. Automaton has 5910 states and 8411 transitions. Word has length 115 [2025-01-09 00:24:10,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:10,641 INFO L471 AbstractCegarLoop]: Abstraction has 5910 states and 8411 transitions. [2025-01-09 00:24:10,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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:24:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5910 states and 8411 transitions. [2025-01-09 00:24:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 00:24:10,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:10,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:10,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:24:10,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:10,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash -451484007, now seen corresponding path program 1 times [2025-01-09 00:24:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:10,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804155860] [2025-01-09 00:24:10,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:10,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 00:24:10,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 00:24:10,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:10,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:10,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:10,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804155860] [2025-01-09 00:24:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804155860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:10,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:10,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:24:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229625215] [2025-01-09 00:24:10,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:10,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:10,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:10,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:10,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:10,919 INFO L87 Difference]: Start difference. First operand 5910 states and 8411 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:15,976 INFO L93 Difference]: Finished difference Result 17505 states and 24942 transitions. [2025-01-09 00:24:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:15,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2025-01-09 00:24:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:16,015 INFO L225 Difference]: With dead ends: 17505 [2025-01-09 00:24:16,016 INFO L226 Difference]: Without dead ends: 11597 [2025-01-09 00:24:16,026 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:24:16,026 INFO L435 NwaCegarLoop]: 1531 mSDtfsCounter, 1750 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 4227 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 5657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:16,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 1804 Invalid, 5657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4227 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-09 00:24:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11597 states. [2025-01-09 00:24:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11597 to 11578. [2025-01-09 00:24:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11578 states, 11577 states have (on average 1.2801243845555843) internal successors, (14820), 11577 states have internal predecessors, (14820), 0 states have call successors, (0), 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:24:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11578 states to 11578 states and 14820 transitions. [2025-01-09 00:24:16,220 INFO L78 Accepts]: Start accepts. Automaton has 11578 states and 14820 transitions. Word has length 141 [2025-01-09 00:24:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:16,221 INFO L471 AbstractCegarLoop]: Abstraction has 11578 states and 14820 transitions. [2025-01-09 00:24:16,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 11578 states and 14820 transitions. [2025-01-09 00:24:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 00:24:16,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:16,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:24:16,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:16,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1599836165, now seen corresponding path program 1 times [2025-01-09 00:24:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:16,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459725026] [2025-01-09 00:24:16,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:16,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 00:24:16,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 00:24:16,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:16,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459725026] [2025-01-09 00:24:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459725026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:16,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:16,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:24:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863774744] [2025-01-09 00:24:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:16,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:16,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:16,439 INFO L87 Difference]: Start difference. First operand 11578 states and 14820 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:21,795 INFO L93 Difference]: Finished difference Result 34273 states and 43832 transitions. [2025-01-09 00:24:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:21,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-01-09 00:24:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:21,850 INFO L225 Difference]: With dead ends: 34273 [2025-01-09 00:24:21,850 INFO L226 Difference]: Without dead ends: 22697 [2025-01-09 00:24:21,864 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:24:21,865 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 2497 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2497 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:21,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2497 Valid, 993 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 00:24:21,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22697 states. [2025-01-09 00:24:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22697 to 22694. [2025-01-09 00:24:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22694 states, 22693 states have (on average 1.238663905168995) internal successors, (28109), 22693 states have internal predecessors, (28109), 0 states have call successors, (0), 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:24:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22694 states to 22694 states and 28109 transitions. [2025-01-09 00:24:22,196 INFO L78 Accepts]: Start accepts. Automaton has 22694 states and 28109 transitions. Word has length 149 [2025-01-09 00:24:22,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:22,197 INFO L471 AbstractCegarLoop]: Abstraction has 22694 states and 28109 transitions. [2025-01-09 00:24:22,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:22,197 INFO L276 IsEmpty]: Start isEmpty. Operand 22694 states and 28109 transitions. [2025-01-09 00:24:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-01-09 00:24:22,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:22,203 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:24:22,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:24:22,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:22,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1740758351, now seen corresponding path program 1 times [2025-01-09 00:24:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:22,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105796860] [2025-01-09 00:24:22,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:22,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-01-09 00:24:22,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-01-09 00:24:22,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:22,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 00:24:23,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:23,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105796860] [2025-01-09 00:24:23,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105796860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:23,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:23,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:23,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959248320] [2025-01-09 00:24:23,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:23,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:24:23,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:23,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:24:23,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:24:23,400 INFO L87 Difference]: Start difference. First operand 22694 states and 28109 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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:24:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:31,283 INFO L93 Difference]: Finished difference Result 57752 states and 69837 transitions. [2025-01-09 00:24:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:24:31,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 411 [2025-01-09 00:24:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:31,353 INFO L225 Difference]: With dead ends: 57752 [2025-01-09 00:24:31,353 INFO L226 Difference]: Without dead ends: 35060 [2025-01-09 00:24:31,379 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:24:31,380 INFO L435 NwaCegarLoop]: 1806 mSDtfsCounter, 3756 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9454 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 9698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 9454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:31,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2162 Invalid, 9698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 9454 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-01-09 00:24:31,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35060 states. [2025-01-09 00:24:31,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35060 to 32288. [2025-01-09 00:24:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32288 states, 32287 states have (on average 1.1912844178771642) internal successors, (38463), 32287 states have internal predecessors, (38463), 0 states have call successors, (0), 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:24:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32288 states to 32288 states and 38463 transitions. [2025-01-09 00:24:31,794 INFO L78 Accepts]: Start accepts. Automaton has 32288 states and 38463 transitions. Word has length 411 [2025-01-09 00:24:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:31,795 INFO L471 AbstractCegarLoop]: Abstraction has 32288 states and 38463 transitions. [2025-01-09 00:24:31,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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:24:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 32288 states and 38463 transitions. [2025-01-09 00:24:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-01-09 00:24:31,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:31,806 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:24:31,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:24:31,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:31,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1703726103, now seen corresponding path program 1 times [2025-01-09 00:24:31,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:31,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591255824] [2025-01-09 00:24:31,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:31,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:31,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-09 00:24:31,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-09 00:24:31,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:31,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 00:24:32,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:32,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591255824] [2025-01-09 00:24:32,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591255824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:32,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:32,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:32,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307656231] [2025-01-09 00:24:32,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:32,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:24:32,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:32,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:24:32,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:24:32,692 INFO L87 Difference]: Start difference. First operand 32288 states and 38463 transitions. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:38,482 INFO L93 Difference]: Finished difference Result 67335 states and 79703 transitions. [2025-01-09 00:24:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:24:38,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2025-01-09 00:24:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:38,550 INFO L225 Difference]: With dead ends: 67335 [2025-01-09 00:24:38,551 INFO L226 Difference]: Without dead ends: 35018 [2025-01-09 00:24:38,583 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:24:38,585 INFO L435 NwaCegarLoop]: 1776 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7327 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 7335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:38,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2118 Invalid, 7335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7327 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-01-09 00:24:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35018 states. [2025-01-09 00:24:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35018 to 35018. [2025-01-09 00:24:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35018 states, 35017 states have (on average 1.1765142645000999) internal successors, (41198), 35017 states have internal predecessors, (41198), 0 states have call successors, (0), 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:24:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35018 states to 35018 states and 41198 transitions. [2025-01-09 00:24:39,000 INFO L78 Accepts]: Start accepts. Automaton has 35018 states and 41198 transitions. Word has length 439 [2025-01-09 00:24:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:39,002 INFO L471 AbstractCegarLoop]: Abstraction has 35018 states and 41198 transitions. [2025-01-09 00:24:39,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35018 states and 41198 transitions. [2025-01-09 00:24:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-09 00:24:39,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:39,011 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:39,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:24:39,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:39,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1857914705, now seen corresponding path program 1 times [2025-01-09 00:24:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:39,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584272071] [2025-01-09 00:24:39,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:39,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:39,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 00:24:39,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 00:24:39,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:39,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:39,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:39,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584272071] [2025-01-09 00:24:39,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584272071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:39,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:39,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:39,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067652870] [2025-01-09 00:24:39,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:39,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:39,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:39,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:39,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:39,596 INFO L87 Difference]: Start difference. First operand 35018 states and 41198 transitions. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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:24:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:44,985 INFO L93 Difference]: Finished difference Result 78377 states and 94558 transitions. [2025-01-09 00:24:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:44,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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 531 [2025-01-09 00:24:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:45,039 INFO L225 Difference]: With dead ends: 78377 [2025-01-09 00:24:45,039 INFO L226 Difference]: Without dead ends: 46091 [2025-01-09 00:24:45,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:45,064 INFO L435 NwaCegarLoop]: 2745 mSDtfsCounter, 1491 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4061 mSolverCounterSat, 1803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 2924 SdHoareTripleChecker+Invalid, 5864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1803 IncrementalHoareTripleChecker+Valid, 4061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:45,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 2924 Invalid, 5864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1803 Valid, 4061 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 00:24:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46091 states. [2025-01-09 00:24:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46091 to 45986. [2025-01-09 00:24:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45986 states, 45985 states have (on average 1.167293682722627) internal successors, (53678), 45985 states have internal predecessors, (53678), 0 states have call successors, (0), 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:24:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45986 states to 45986 states and 53678 transitions. [2025-01-09 00:24:45,732 INFO L78 Accepts]: Start accepts. Automaton has 45986 states and 53678 transitions. Word has length 531 [2025-01-09 00:24:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:45,734 INFO L471 AbstractCegarLoop]: Abstraction has 45986 states and 53678 transitions. [2025-01-09 00:24:45,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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:24:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 45986 states and 53678 transitions. [2025-01-09 00:24:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 744 [2025-01-09 00:24:45,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:45,743 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:45,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:24:45,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:45,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash 593049223, now seen corresponding path program 1 times [2025-01-09 00:24:45,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:45,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646919279] [2025-01-09 00:24:45,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:45,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:45,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 743 statements into 1 equivalence classes. [2025-01-09 00:24:45,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 743 of 743 statements. [2025-01-09 00:24:45,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:45,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-01-09 00:24:46,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:46,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646919279] [2025-01-09 00:24:46,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646919279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:46,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:46,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:46,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95505223] [2025-01-09 00:24:46,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:46,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:46,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:46,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:46,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:46,503 INFO L87 Difference]: Start difference. First operand 45986 states and 53678 transitions. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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:24:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:52,454 INFO L93 Difference]: Finished difference Result 104403 states and 124098 transitions. [2025-01-09 00:24:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:52,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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 743 [2025-01-09 00:24:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:52,540 INFO L225 Difference]: With dead ends: 104403 [2025-01-09 00:24:52,540 INFO L226 Difference]: Without dead ends: 61149 [2025-01-09 00:24:52,578 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:24:52,579 INFO L435 NwaCegarLoop]: 3199 mSDtfsCounter, 1432 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 5099 mSolverCounterSat, 970 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 3375 SdHoareTripleChecker+Invalid, 6069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 970 IncrementalHoareTripleChecker+Valid, 5099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:52,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1432 Valid, 3375 Invalid, 6069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [970 Valid, 5099 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-01-09 00:24:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61149 states. [2025-01-09 00:24:53,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61149 to 61057. [2025-01-09 00:24:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61057 states, 61056 states have (on average 1.1519097222222223) internal successors, (70331), 61056 states have internal predecessors, (70331), 0 states have call successors, (0), 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:24:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61057 states to 61057 states and 70331 transitions. [2025-01-09 00:24:53,240 INFO L78 Accepts]: Start accepts. Automaton has 61057 states and 70331 transitions. Word has length 743 [2025-01-09 00:24:53,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:53,241 INFO L471 AbstractCegarLoop]: Abstraction has 61057 states and 70331 transitions. [2025-01-09 00:24:53,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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:24:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 61057 states and 70331 transitions. [2025-01-09 00:24:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2025-01-09 00:24:53,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:53,247 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:53,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:24:53,247 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:53,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash 278574225, now seen corresponding path program 1 times [2025-01-09 00:24:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:53,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996741130] [2025-01-09 00:24:53,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:53,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:53,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-01-09 00:24:53,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-01-09 00:24:53,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:53,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 105 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:54,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:54,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996741130] [2025-01-09 00:24:54,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996741130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:24:54,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672266485] [2025-01-09 00:24:54,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:54,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:24:54,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:24:54,919 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:24:54,921 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:24:55,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-01-09 00:24:55,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-01-09 00:24:55,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:55,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:55,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:24:55,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:24:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-01-09 00:24:55,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:24:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672266485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:55,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:24:55,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:24:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396614968] [2025-01-09 00:24:55,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:55,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:55,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:55,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:55,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:24:55,311 INFO L87 Difference]: Start difference. First operand 61057 states and 70331 transitions. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)