./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label25.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 1a498dbc067f1de398639e507498752ad05d79db17a274a9c2dbfecc9e6d20a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:41:48,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:41:48,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:41:48,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:41:48,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:41:48,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:41:48,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:41:48,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:41:48,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:41:48,792 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:41:48,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:41:48,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:41:48,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:41:48,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:41:48,794 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:41:48,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:41:48,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:41:48,795 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:41:48,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:41:48,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:41:48,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:41:48,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:41:48,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:41:48,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:41:48,795 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:41:48,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:41:48,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:41:48,796 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:41:48,796 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:41:48,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:41:48,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:41:48,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:41:48,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:48,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:41:48,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:41:48,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:41:48,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:41:48,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:48,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:41:48,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:41:48,797 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:41:48,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:41:48,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:41:48,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:41:48,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:41:48,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:41:48,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:41:48,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:41:48,798 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 -> 1a498dbc067f1de398639e507498752ad05d79db17a274a9c2dbfecc9e6d20a0 [2025-01-08 23:41:49,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:41:49,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:41:49,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:41:49,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:41:49,086 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:41:49,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label25.c [2025-01-08 23:41:50,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c2654b8e/96057615f2e148e596a097a0c1206226/FLAG195d74acf [2025-01-08 23:41:50,715 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:41:50,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label25.c [2025-01-08 23:41:50,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c2654b8e/96057615f2e148e596a097a0c1206226/FLAG195d74acf [2025-01-08 23:41:50,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c2654b8e/96057615f2e148e596a097a0c1206226 [2025-01-08 23:41:50,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:41:50,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:41:50,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:41:50,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:41:50,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:41:50,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:41:50" (1/1) ... [2025-01-08 23:41:50,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15aa2641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:50, skipping insertion in model container [2025-01-08 23:41:50,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:41:50" (1/1) ... [2025-01-08 23:41:51,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:41:51,185 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label25.c[4556,4569] [2025-01-08 23:41:51,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:41:51,461 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:41:51,478 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label25.c[4556,4569] [2025-01-08 23:41:51,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:41:51,599 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:41:51,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51 WrapperNode [2025-01-08 23:41:51,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:41:51,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:41:51,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:41:51,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:41:51,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,721 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:41:51,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:41:51,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:41:51,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:41:51,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:41:51,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,827 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:41:51,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:41:51,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:41:51,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:41:51,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:41:51,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (1/1) ... [2025-01-08 23:41:51,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:51,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:51,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:41:51,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:41:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:41:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:41:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:41:51,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:41:52,054 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:41:52,056 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:41:53,496 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:41:53,496 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:41:53,516 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:41:53,516 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:41:53,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:53 BoogieIcfgContainer [2025-01-08 23:41:53,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:41:53,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:41:53,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:41:53,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:41:53,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:41:50" (1/3) ... [2025-01-08 23:41:53,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e78f612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:41:53, skipping insertion in model container [2025-01-08 23:41:53,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:51" (2/3) ... [2025-01-08 23:41:53,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e78f612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:41:53, skipping insertion in model container [2025-01-08 23:41:53,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:53" (3/3) ... [2025-01-08 23:41:53,526 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label25.c [2025-01-08 23:41:53,538 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:41:53,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label25.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:41:53,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:41:53,615 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;@264a88b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:41:53,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:41:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-08 23:41:53,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:53,624 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] [2025-01-08 23:41:53,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:53,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:53,628 INFO L85 PathProgramCache]: Analyzing trace with hash 301988588, now seen corresponding path program 1 times [2025-01-08 23:41:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:53,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574375433] [2025-01-08 23:41:53,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:53,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-08 23:41:53,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 23:41:53,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:53,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574375433] [2025-01-08 23:41:53,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574375433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:53,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:53,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344920411] [2025-01-08 23:41:53,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:53,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:53,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:53,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:53,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:53,976 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:55,058 INFO L93 Difference]: Finished difference Result 776 states and 1360 transitions. [2025-01-08 23:41:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:55,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-01-08 23:41:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:55,069 INFO L225 Difference]: With dead ends: 776 [2025-01-08 23:41:55,069 INFO L226 Difference]: Without dead ends: 413 [2025-01-08 23:41:55,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:55,074 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 196 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:55,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 197 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:41:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-08 23:41:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2025-01-08 23:41:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2025-01-08 23:41:55,150 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 31 [2025-01-08 23:41:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:55,151 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2025-01-08 23:41:55,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2025-01-08 23:41:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-08 23:41:55,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:55,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:55,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:41:55,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:55,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:55,155 INFO L85 PathProgramCache]: Analyzing trace with hash 670296211, now seen corresponding path program 1 times [2025-01-08 23:41:55,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:55,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485045093] [2025-01-08 23:41:55,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:55,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:55,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-08 23:41:55,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-08 23:41:55,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:55,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:55,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:55,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485045093] [2025-01-08 23:41:55,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485045093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:55,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:55,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:55,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936234214] [2025-01-08 23:41:55,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:55,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:55,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:55,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:55,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:55,453 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:56,227 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2025-01-08 23:41:56,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:56,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-08 23:41:56,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:56,231 INFO L225 Difference]: With dead ends: 1209 [2025-01-08 23:41:56,231 INFO L226 Difference]: Without dead ends: 800 [2025-01-08 23:41:56,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:56,232 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:56,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 121 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:41:56,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-08 23:41:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2025-01-08 23:41:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2025-01-08 23:41:56,262 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 99 [2025-01-08 23:41:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:56,262 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2025-01-08 23:41:56,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2025-01-08 23:41:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-08 23:41:56,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:56,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:56,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:41:56,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:56,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:56,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1416934440, now seen corresponding path program 1 times [2025-01-08 23:41:56,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:56,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390301221] [2025-01-08 23:41:56,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:56,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:56,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-08 23:41:56,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-08 23:41:56,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:56,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:56,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:56,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390301221] [2025-01-08 23:41:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390301221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:56,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:56,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:56,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778072872] [2025-01-08 23:41:56,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:56,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:56,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:56,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:56,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:56,581 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:57,203 INFO L93 Difference]: Finished difference Result 1941 states and 2630 transitions. [2025-01-08 23:41:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-01-08 23:41:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:57,209 INFO L225 Difference]: With dead ends: 1941 [2025-01-08 23:41:57,209 INFO L226 Difference]: Without dead ends: 1156 [2025-01-08 23:41:57,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:57,211 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 120 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:57,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 193 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-01-08 23:41:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2025-01-08 23:41:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions. [2025-01-08 23:41:57,251 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 100 [2025-01-08 23:41:57,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:57,251 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions. [2025-01-08 23:41:57,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions. [2025-01-08 23:41:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-08 23:41:57,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:57,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:57,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:41:57,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:57,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1824797553, now seen corresponding path program 1 times [2025-01-08 23:41:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:57,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278960450] [2025-01-08 23:41:57,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:57,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:57,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-08 23:41:57,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-08 23:41:57,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:57,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:57,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278960450] [2025-01-08 23:41:57,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278960450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:57,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:57,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:57,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755812979] [2025-01-08 23:41:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:57,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:57,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:57,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:57,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:57,481 INFO L87 Difference]: Start difference. First operand 1156 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:58,244 INFO L93 Difference]: Finished difference Result 2877 states and 3707 transitions. [2025-01-08 23:41:58,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:58,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-01-08 23:41:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:58,251 INFO L225 Difference]: With dead ends: 2877 [2025-01-08 23:41:58,251 INFO L226 Difference]: Without dead ends: 1723 [2025-01-08 23:41:58,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:58,254 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 175 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:58,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 335 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:41:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-01-08 23:41:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1529. [2025-01-08 23:41:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1528 states have (on average 1.2611256544502618) internal successors, (1927), 1528 states have internal predecessors, (1927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1927 transitions. [2025-01-08 23:41:58,283 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1927 transitions. Word has length 143 [2025-01-08 23:41:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:58,284 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 1927 transitions. [2025-01-08 23:41:58,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1927 transitions. [2025-01-08 23:41:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-08 23:41:58,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:58,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:58,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:41:58,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:58,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash 468745307, now seen corresponding path program 1 times [2025-01-08 23:41:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:58,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433311460] [2025-01-08 23:41:58,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:58,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-08 23:41:58,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-08 23:41:58,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:58,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:58,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:58,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433311460] [2025-01-08 23:41:58,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433311460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:58,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:58,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:58,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808325379] [2025-01-08 23:41:58,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:58,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:58,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:58,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:58,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:58,484 INFO L87 Difference]: Start difference. First operand 1529 states and 1927 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:59,141 INFO L93 Difference]: Finished difference Result 3617 states and 4543 transitions. [2025-01-08 23:41:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:59,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2025-01-08 23:41:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:59,150 INFO L225 Difference]: With dead ends: 3617 [2025-01-08 23:41:59,150 INFO L226 Difference]: Without dead ends: 1906 [2025-01-08 23:41:59,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:59,155 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 171 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:59,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 348 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2025-01-08 23:41:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1897. [2025-01-08 23:41:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1896 states have (on average 1.246308016877637) internal successors, (2363), 1896 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2363 transitions. [2025-01-08 23:41:59,200 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2363 transitions. Word has length 174 [2025-01-08 23:41:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:59,200 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2363 transitions. [2025-01-08 23:41:59,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2363 transitions. [2025-01-08 23:41:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-08 23:41:59,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:59,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:59,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:41:59,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:59,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1362250205, now seen corresponding path program 1 times [2025-01-08 23:41:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:59,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729091748] [2025-01-08 23:41:59,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:59,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:59,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-08 23:41:59,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-08 23:41:59,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:59,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-08 23:41:59,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:59,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729091748] [2025-01-08 23:41:59,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729091748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:59,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:59,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:59,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655538631] [2025-01-08 23:41:59,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:59,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:59,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:59,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:59,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:59,460 INFO L87 Difference]: Start difference. First operand 1897 states and 2363 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:00,194 INFO L93 Difference]: Finished difference Result 4904 states and 6161 transitions. [2025-01-08 23:42:00,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:00,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-01-08 23:42:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:00,203 INFO L225 Difference]: With dead ends: 4904 [2025-01-08 23:42:00,203 INFO L226 Difference]: Without dead ends: 3009 [2025-01-08 23:42:00,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:00,206 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 39 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:00,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 155 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:42:00,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2025-01-08 23:42:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 3008. [2025-01-08 23:42:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.2038576654472897) internal successors, (3620), 3007 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3620 transitions. [2025-01-08 23:42:00,254 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 3620 transitions. Word has length 212 [2025-01-08 23:42:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:00,255 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 3620 transitions. [2025-01-08 23:42:00,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 3620 transitions. [2025-01-08 23:42:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-08 23:42:00,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:00,258 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:00,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:42:00,258 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:00,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:00,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1720872411, now seen corresponding path program 1 times [2025-01-08 23:42:00,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:00,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197003810] [2025-01-08 23:42:00,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:00,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:00,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-08 23:42:00,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-08 23:42:00,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:00,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:42:00,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:00,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197003810] [2025-01-08 23:42:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197003810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:00,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:00,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541131627] [2025-01-08 23:42:00,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:00,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:00,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:00,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:00,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:00,470 INFO L87 Difference]: Start difference. First operand 3008 states and 3620 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:01,280 INFO L93 Difference]: Finished difference Result 6759 states and 8218 transitions. [2025-01-08 23:42:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:01,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-01-08 23:42:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:01,291 INFO L225 Difference]: With dead ends: 6759 [2025-01-08 23:42:01,291 INFO L226 Difference]: Without dead ends: 3753 [2025-01-08 23:42:01,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:01,294 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 166 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:01,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 379 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2025-01-08 23:42:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 3560. [2025-01-08 23:42:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3560 states, 3559 states have (on average 1.1989322843495365) internal successors, (4267), 3559 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 4267 transitions. [2025-01-08 23:42:01,345 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 4267 transitions. Word has length 213 [2025-01-08 23:42:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:01,346 INFO L471 AbstractCegarLoop]: Abstraction has 3560 states and 4267 transitions. [2025-01-08 23:42:01,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 4267 transitions. [2025-01-08 23:42:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-08 23:42:01,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:01,353 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:01,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:42:01,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:01,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:01,354 INFO L85 PathProgramCache]: Analyzing trace with hash 39863629, now seen corresponding path program 1 times [2025-01-08 23:42:01,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:01,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091493474] [2025-01-08 23:42:01,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:01,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:01,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-08 23:42:01,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-08 23:42:01,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:01,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:01,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:01,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091493474] [2025-01-08 23:42:01,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091493474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:01,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:01,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:01,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006145522] [2025-01-08 23:42:01,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:01,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:01,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:01,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:01,777 INFO L87 Difference]: Start difference. First operand 3560 states and 4267 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:03,069 INFO L93 Difference]: Finished difference Result 11018 states and 13449 transitions. [2025-01-08 23:42:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:03,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2025-01-08 23:42:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:03,084 INFO L225 Difference]: With dead ends: 11018 [2025-01-08 23:42:03,084 INFO L226 Difference]: Without dead ends: 7460 [2025-01-08 23:42:03,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:03,088 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 303 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:03,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 232 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 23:42:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7460 states. [2025-01-08 23:42:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7460 to 6158. [2025-01-08 23:42:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6158 states, 6157 states have (on average 1.194250446646094) internal successors, (7353), 6157 states have internal predecessors, (7353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6158 states to 6158 states and 7353 transitions. [2025-01-08 23:42:03,185 INFO L78 Accepts]: Start accepts. Automaton has 6158 states and 7353 transitions. Word has length 233 [2025-01-08 23:42:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:03,186 INFO L471 AbstractCegarLoop]: Abstraction has 6158 states and 7353 transitions. [2025-01-08 23:42:03,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 6158 states and 7353 transitions. [2025-01-08 23:42:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-08 23:42:03,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:03,190 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:03,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:42:03,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:03,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash 835160454, now seen corresponding path program 1 times [2025-01-08 23:42:03,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:03,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15737069] [2025-01-08 23:42:03,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:03,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:03,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-08 23:42:03,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-08 23:42:03,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:03,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:03,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:03,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15737069] [2025-01-08 23:42:03,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15737069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:03,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:03,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:03,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419626187] [2025-01-08 23:42:03,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:03,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:03,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:03,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:03,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:03,543 INFO L87 Difference]: Start difference. First operand 6158 states and 7353 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:04,836 INFO L93 Difference]: Finished difference Result 15825 states and 19198 transitions. [2025-01-08 23:42:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:04,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2025-01-08 23:42:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:04,873 INFO L225 Difference]: With dead ends: 15825 [2025-01-08 23:42:04,873 INFO L226 Difference]: Without dead ends: 9669 [2025-01-08 23:42:04,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:04,880 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 311 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:04,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 135 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 23:42:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9669 states. [2025-01-08 23:42:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9669 to 9291. [2025-01-08 23:42:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9291 states, 9290 states have (on average 1.1996770721205599) internal successors, (11145), 9290 states have internal predecessors, (11145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 11145 transitions. [2025-01-08 23:42:05,044 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 11145 transitions. Word has length 243 [2025-01-08 23:42:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:05,045 INFO L471 AbstractCegarLoop]: Abstraction has 9291 states and 11145 transitions. [2025-01-08 23:42:05,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 11145 transitions. [2025-01-08 23:42:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-08 23:42:05,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:05,049 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:05,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:42:05,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:05,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1201135985, now seen corresponding path program 1 times [2025-01-08 23:42:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:05,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515820105] [2025-01-08 23:42:05,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:05,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:05,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-08 23:42:05,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-08 23:42:05,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:05,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515820105] [2025-01-08 23:42:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515820105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:05,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:05,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105522444] [2025-01-08 23:42:05,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:05,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:05,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:05,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:05,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:05,302 INFO L87 Difference]: Start difference. First operand 9291 states and 11145 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:06,624 INFO L93 Difference]: Finished difference Result 27449 states and 33264 transitions. [2025-01-08 23:42:06,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:06,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2025-01-08 23:42:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:06,659 INFO L225 Difference]: With dead ends: 27449 [2025-01-08 23:42:06,659 INFO L226 Difference]: Without dead ends: 18160 [2025-01-08 23:42:06,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:06,672 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 285 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:06,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 84 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 23:42:06,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18160 states. [2025-01-08 23:42:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18160 to 18159. [2025-01-08 23:42:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18159 states, 18158 states have (on average 1.2010133274589712) internal successors, (21808), 18158 states have internal predecessors, (21808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18159 states to 18159 states and 21808 transitions. [2025-01-08 23:42:06,959 INFO L78 Accepts]: Start accepts. Automaton has 18159 states and 21808 transitions. Word has length 243 [2025-01-08 23:42:06,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:06,960 INFO L471 AbstractCegarLoop]: Abstraction has 18159 states and 21808 transitions. [2025-01-08 23:42:06,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 18159 states and 21808 transitions. [2025-01-08 23:42:06,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-01-08 23:42:06,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:06,965 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:06,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:42:06,965 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:06,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:06,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1155728670, now seen corresponding path program 1 times [2025-01-08 23:42:06,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:06,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554557697] [2025-01-08 23:42:06,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:06,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:06,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-08 23:42:07,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-08 23:42:07,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:07,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-08 23:42:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554557697] [2025-01-08 23:42:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554557697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:07,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:07,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337318709] [2025-01-08 23:42:07,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:07,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:07,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:07,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:07,151 INFO L87 Difference]: Start difference. First operand 18159 states and 21808 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:08,052 INFO L93 Difference]: Finished difference Result 36142 states and 43445 transitions. [2025-01-08 23:42:08,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:08,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2025-01-08 23:42:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:08,085 INFO L225 Difference]: With dead ends: 36142 [2025-01-08 23:42:08,086 INFO L226 Difference]: Without dead ends: 18169 [2025-01-08 23:42:08,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:08,105 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 170 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:08,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 377 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18169 states. [2025-01-08 23:42:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18169 to 18158. [2025-01-08 23:42:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18158 states, 18157 states have (on average 1.1642341796552294) internal successors, (21139), 18157 states have internal predecessors, (21139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18158 states to 18158 states and 21139 transitions. [2025-01-08 23:42:08,451 INFO L78 Accepts]: Start accepts. Automaton has 18158 states and 21139 transitions. Word has length 250 [2025-01-08 23:42:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:08,452 INFO L471 AbstractCegarLoop]: Abstraction has 18158 states and 21139 transitions. [2025-01-08 23:42:08,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 18158 states and 21139 transitions. [2025-01-08 23:42:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-01-08 23:42:08,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:08,459 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:08,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:42:08,459 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:08,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1351274983, now seen corresponding path program 1 times [2025-01-08 23:42:08,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:08,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703470291] [2025-01-08 23:42:08,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:08,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:08,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-01-08 23:42:08,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-01-08 23:42:08,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:08,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:08,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703470291] [2025-01-08 23:42:08,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703470291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:08,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:08,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:08,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673233741] [2025-01-08 23:42:08,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:08,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:08,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:08,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:08,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:08,945 INFO L87 Difference]: Start difference. First operand 18158 states and 21139 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:09,827 INFO L93 Difference]: Finished difference Result 38150 states and 44772 transitions. [2025-01-08 23:42:09,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:09,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2025-01-08 23:42:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:09,850 INFO L225 Difference]: With dead ends: 38150 [2025-01-08 23:42:09,850 INFO L226 Difference]: Without dead ends: 19809 [2025-01-08 23:42:09,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:09,868 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 215 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:09,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 171 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:09,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19809 states. [2025-01-08 23:42:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19809 to 17396. [2025-01-08 23:42:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17396 states, 17395 states have (on average 1.1277378557056625) internal successors, (19617), 17395 states have internal predecessors, (19617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17396 states to 17396 states and 19617 transitions. [2025-01-08 23:42:10,128 INFO L78 Accepts]: Start accepts. Automaton has 17396 states and 19617 transitions. Word has length 264 [2025-01-08 23:42:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:10,129 INFO L471 AbstractCegarLoop]: Abstraction has 17396 states and 19617 transitions. [2025-01-08 23:42:10,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 17396 states and 19617 transitions. [2025-01-08 23:42:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-01-08 23:42:10,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:10,137 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:10,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:42:10,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:10,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1230412175, now seen corresponding path program 1 times [2025-01-08 23:42:10,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:10,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335756269] [2025-01-08 23:42:10,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:10,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-01-08 23:42:10,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-01-08 23:42:10,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:10,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-01-08 23:42:10,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:10,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335756269] [2025-01-08 23:42:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335756269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:10,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:10,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663389947] [2025-01-08 23:42:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:10,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:10,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:10,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:10,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:10,316 INFO L87 Difference]: Start difference. First operand 17396 states and 19617 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:10,980 INFO L93 Difference]: Finished difference Result 36630 states and 41344 transitions. [2025-01-08 23:42:10,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:10,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2025-01-08 23:42:10,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:11,002 INFO L225 Difference]: With dead ends: 36630 [2025-01-08 23:42:11,002 INFO L226 Difference]: Without dead ends: 19604 [2025-01-08 23:42:11,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:11,014 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 162 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:11,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 383 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19604 states. [2025-01-08 23:42:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19604 to 18868. [2025-01-08 23:42:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18868 states, 18867 states have (on average 1.1213759474214235) internal successors, (21157), 18867 states have internal predecessors, (21157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18868 states to 18868 states and 21157 transitions. [2025-01-08 23:42:11,218 INFO L78 Accepts]: Start accepts. Automaton has 18868 states and 21157 transitions. Word has length 298 [2025-01-08 23:42:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:11,218 INFO L471 AbstractCegarLoop]: Abstraction has 18868 states and 21157 transitions. [2025-01-08 23:42:11,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 18868 states and 21157 transitions. [2025-01-08 23:42:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-01-08 23:42:11,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:11,228 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:11,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:42:11,228 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:11,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:11,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1979534203, now seen corresponding path program 1 times [2025-01-08 23:42:11,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:11,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021439411] [2025-01-08 23:42:11,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:11,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:11,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-08 23:42:11,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-08 23:42:11,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:11,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:42:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021439411] [2025-01-08 23:42:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021439411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:11,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:11,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156377361] [2025-01-08 23:42:11,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:11,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:11,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:11,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:11,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:11,694 INFO L87 Difference]: Start difference. First operand 18868 states and 21157 transitions. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:12,894 INFO L93 Difference]: Finished difference Result 44014 states and 49440 transitions. [2025-01-08 23:42:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:12,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 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 318 [2025-01-08 23:42:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:12,923 INFO L225 Difference]: With dead ends: 44014 [2025-01-08 23:42:12,923 INFO L226 Difference]: Without dead ends: 27728 [2025-01-08 23:42:12,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:12,938 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 331 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:12,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 81 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 23:42:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27728 states. [2025-01-08 23:42:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27728 to 25691. [2025-01-08 23:42:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25691 states, 25690 states have (on average 1.1178279486181393) internal successors, (28717), 25690 states have internal predecessors, (28717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25691 states to 25691 states and 28717 transitions. [2025-01-08 23:42:13,282 INFO L78 Accepts]: Start accepts. Automaton has 25691 states and 28717 transitions. Word has length 318 [2025-01-08 23:42:13,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:13,283 INFO L471 AbstractCegarLoop]: Abstraction has 25691 states and 28717 transitions. [2025-01-08 23:42:13,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 25691 states and 28717 transitions. [2025-01-08 23:42:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-08 23:42:13,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:13,295 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:13,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:42:13,296 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:13,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash -383412511, now seen corresponding path program 1 times [2025-01-08 23:42:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566756909] [2025-01-08 23:42:13,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:13,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-08 23:42:13,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-08 23:42:13,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:13,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-01-08 23:42:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:13,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566756909] [2025-01-08 23:42:13,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566756909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:13,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388045001] [2025-01-08 23:42:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:13,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:13,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:13,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:13,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:13,514 INFO L87 Difference]: Start difference. First operand 25691 states and 28717 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:14,213 INFO L93 Difference]: Finished difference Result 52847 states and 59057 transitions. [2025-01-08 23:42:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:14,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 325 [2025-01-08 23:42:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:14,248 INFO L225 Difference]: With dead ends: 52847 [2025-01-08 23:42:14,248 INFO L226 Difference]: Without dead ends: 30842 [2025-01-08 23:42:14,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:14,268 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 189 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:14,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 148 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30842 states. [2025-01-08 23:42:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30842 to 19242. [2025-01-08 23:42:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19242 states, 19241 states have (on average 1.1261368951717685) internal successors, (21668), 19241 states have internal predecessors, (21668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19242 states to 19242 states and 21668 transitions. [2025-01-08 23:42:14,491 INFO L78 Accepts]: Start accepts. Automaton has 19242 states and 21668 transitions. Word has length 325 [2025-01-08 23:42:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:14,492 INFO L471 AbstractCegarLoop]: Abstraction has 19242 states and 21668 transitions. [2025-01-08 23:42:14,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 19242 states and 21668 transitions. [2025-01-08 23:42:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-08 23:42:14,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:14,496 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:14,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:42:14,497 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:14,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1134229435, now seen corresponding path program 1 times [2025-01-08 23:42:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:14,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838276632] [2025-01-08 23:42:14,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:14,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:14,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-08 23:42:14,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-08 23:42:14,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:14,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 57 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:14,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:14,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838276632] [2025-01-08 23:42:14,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838276632] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:14,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969091564] [2025-01-08 23:42:14,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:14,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:14,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:14,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:42:14,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:42:14,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-08 23:42:14,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-08 23:42:14,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:14,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:14,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 23:42:15,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 57 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:15,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:42:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 57 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:17,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969091564] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:42:17,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:42:17,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-01-08 23:42:17,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281232181] [2025-01-08 23:42:17,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:42:17,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 23:42:17,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:17,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 23:42:17,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:42:17,188 INFO L87 Difference]: Start difference. First operand 19242 states and 21668 transitions. Second operand has 10 states, 10 states have (on average 68.9) internal successors, (689), 9 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:20,035 INFO L93 Difference]: Finished difference Result 64855 states and 72727 transitions. [2025-01-08 23:42:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 23:42:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 68.9) internal successors, (689), 9 states have internal predecessors, (689), 0 states have call successors, (0), 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 329 [2025-01-08 23:42:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:20,074 INFO L225 Difference]: With dead ends: 64855 [2025-01-08 23:42:20,074 INFO L226 Difference]: Without dead ends: 45246 [2025-01-08 23:42:20,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:42:20,090 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1092 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 3175 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 3894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 3175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:20,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 179 Invalid, 3894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 3175 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:42:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45246 states. [2025-01-08 23:42:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45246 to 35478. [2025-01-08 23:42:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35478 states, 35477 states have (on average 1.1222764044310398) internal successors, (39815), 35477 states have internal predecessors, (39815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35478 states to 35478 states and 39815 transitions. [2025-01-08 23:42:20,461 INFO L78 Accepts]: Start accepts. Automaton has 35478 states and 39815 transitions. Word has length 329 [2025-01-08 23:42:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:20,462 INFO L471 AbstractCegarLoop]: Abstraction has 35478 states and 39815 transitions. [2025-01-08 23:42:20,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 68.9) internal successors, (689), 9 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 35478 states and 39815 transitions. [2025-01-08 23:42:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-01-08 23:42:20,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:20,477 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:20,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:42:20,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 23:42:20,679 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:20,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1471318444, now seen corresponding path program 1 times [2025-01-08 23:42:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:20,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520312055] [2025-01-08 23:42:20,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:20,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:20,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-01-08 23:42:20,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-01-08 23:42:20,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:20,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-08 23:42:21,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:21,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520312055] [2025-01-08 23:42:21,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520312055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:21,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:21,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:21,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718583236] [2025-01-08 23:42:21,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:21,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:21,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:21,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:21,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:21,137 INFO L87 Difference]: Start difference. First operand 35478 states and 39815 transitions. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:21,911 INFO L93 Difference]: Finished difference Result 68744 states and 77084 transitions. [2025-01-08 23:42:21,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:21,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 401 [2025-01-08 23:42:21,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:21,943 INFO L225 Difference]: With dead ends: 68744 [2025-01-08 23:42:21,943 INFO L226 Difference]: Without dead ends: 35666 [2025-01-08 23:42:21,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:21,964 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 183 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:21,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 169 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35666 states. [2025-01-08 23:42:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35666 to 33270. [2025-01-08 23:42:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33270 states, 33269 states have (on average 1.1191199014097208) internal successors, (37232), 33269 states have internal predecessors, (37232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33270 states to 33270 states and 37232 transitions. [2025-01-08 23:42:22,244 INFO L78 Accepts]: Start accepts. Automaton has 33270 states and 37232 transitions. Word has length 401 [2025-01-08 23:42:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:22,244 INFO L471 AbstractCegarLoop]: Abstraction has 33270 states and 37232 transitions. [2025-01-08 23:42:22,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 33270 states and 37232 transitions. [2025-01-08 23:42:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-01-08 23:42:22,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:22,255 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:22,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:42:22,255 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:22,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:22,255 INFO L85 PathProgramCache]: Analyzing trace with hash 326606668, now seen corresponding path program 1 times [2025-01-08 23:42:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:22,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769983219] [2025-01-08 23:42:22,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:22,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-01-08 23:42:22,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-01-08 23:42:22,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:22,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-01-08 23:42:22,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:22,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769983219] [2025-01-08 23:42:22,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769983219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:22,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:22,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290524656] [2025-01-08 23:42:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:22,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:22,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:22,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:22,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:22,507 INFO L87 Difference]: Start difference. First operand 33270 states and 37232 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:23,221 INFO L93 Difference]: Finished difference Result 65059 states and 72808 transitions. [2025-01-08 23:42:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:23,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 404 [2025-01-08 23:42:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:23,261 INFO L225 Difference]: With dead ends: 65059 [2025-01-08 23:42:23,261 INFO L226 Difference]: Without dead ends: 34188 [2025-01-08 23:42:23,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:23,284 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 170 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:23,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 354 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34188 states. [2025-01-08 23:42:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34188 to 19232. [2025-01-08 23:42:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19232 states, 19231 states have (on average 1.1150226197285633) internal successors, (21443), 19231 states have internal predecessors, (21443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19232 states to 19232 states and 21443 transitions. [2025-01-08 23:42:23,574 INFO L78 Accepts]: Start accepts. Automaton has 19232 states and 21443 transitions. Word has length 404 [2025-01-08 23:42:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:23,574 INFO L471 AbstractCegarLoop]: Abstraction has 19232 states and 21443 transitions. [2025-01-08 23:42:23,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 19232 states and 21443 transitions. [2025-01-08 23:42:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-08 23:42:23,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:23,582 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:23,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:42:23,582 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:23,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:23,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1698961904, now seen corresponding path program 1 times [2025-01-08 23:42:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:23,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976947920] [2025-01-08 23:42:23,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:23,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:23,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-08 23:42:23,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-08 23:42:23,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:23,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-08 23:42:23,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:23,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976947920] [2025-01-08 23:42:23,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976947920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:23,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:23,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:23,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508757123] [2025-01-08 23:42:23,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:23,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:23,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:23,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:23,847 INFO L87 Difference]: Start difference. First operand 19232 states and 21443 transitions. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:24,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:24,739 INFO L93 Difference]: Finished difference Result 39575 states and 44080 transitions. [2025-01-08 23:42:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:24,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 435 [2025-01-08 23:42:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:24,756 INFO L225 Difference]: With dead ends: 39575 [2025-01-08 23:42:24,756 INFO L226 Difference]: Without dead ends: 20345 [2025-01-08 23:42:24,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:24,767 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 185 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:24,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 82 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20345 states. [2025-01-08 23:42:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20345 to 19048. [2025-01-08 23:42:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19048 states, 19047 states have (on average 1.11366619415131) internal successors, (21212), 19047 states have internal predecessors, (21212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19048 states to 19048 states and 21212 transitions. [2025-01-08 23:42:24,963 INFO L78 Accepts]: Start accepts. Automaton has 19048 states and 21212 transitions. Word has length 435 [2025-01-08 23:42:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:24,964 INFO L471 AbstractCegarLoop]: Abstraction has 19048 states and 21212 transitions. [2025-01-08 23:42:24,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 19048 states and 21212 transitions. [2025-01-08 23:42:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-01-08 23:42:24,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:24,974 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:24,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:42:24,974 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:24,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1544005734, now seen corresponding path program 1 times [2025-01-08 23:42:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:24,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785166417] [2025-01-08 23:42:24,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:24,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:24,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-01-08 23:42:25,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-01-08 23:42:25,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:25,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-01-08 23:42:25,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:25,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785166417] [2025-01-08 23:42:25,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785166417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:25,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:25,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:25,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82950138] [2025-01-08 23:42:25,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:25,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:25,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:25,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:25,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:25,120 INFO L87 Difference]: Start difference. First operand 19048 states and 21212 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:25,646 INFO L93 Difference]: Finished difference Result 39380 states and 43798 transitions. [2025-01-08 23:42:25,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:25,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 449 [2025-01-08 23:42:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:25,662 INFO L225 Difference]: With dead ends: 39380 [2025-01-08 23:42:25,662 INFO L226 Difference]: Without dead ends: 20150 [2025-01-08 23:42:25,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:25,673 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 173 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:25,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 148 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20150 states. [2025-01-08 23:42:25,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20150 to 18120. [2025-01-08 23:42:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18120 states, 18119 states have (on average 1.11049174899277) internal successors, (20121), 18119 states have internal predecessors, (20121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 20121 transitions. [2025-01-08 23:42:25,817 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 20121 transitions. Word has length 449 [2025-01-08 23:42:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:25,818 INFO L471 AbstractCegarLoop]: Abstraction has 18120 states and 20121 transitions. [2025-01-08 23:42:25,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 20121 transitions. [2025-01-08 23:42:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-01-08 23:42:25,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:25,827 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:25,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 23:42:25,827 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:25,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:25,828 INFO L85 PathProgramCache]: Analyzing trace with hash 407270111, now seen corresponding path program 1 times [2025-01-08 23:42:25,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:25,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934760848] [2025-01-08 23:42:25,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:25,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:25,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-01-08 23:42:25,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-01-08 23:42:25,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:25,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-08 23:42:26,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934760848] [2025-01-08 23:42:26,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934760848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:26,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:26,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 23:42:26,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316183893] [2025-01-08 23:42:26,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:26,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:42:26,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:26,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:42:26,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:42:26,395 INFO L87 Difference]: Start difference. First operand 18120 states and 20121 transitions. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:27,713 INFO L93 Difference]: Finished difference Result 45478 states and 50445 transitions. [2025-01-08 23:42:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:42:27,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 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 496 [2025-01-08 23:42:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:27,749 INFO L225 Difference]: With dead ends: 45478 [2025-01-08 23:42:27,749 INFO L226 Difference]: Without dead ends: 27360 [2025-01-08 23:42:27,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:42:27,766 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 378 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:27,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 114 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 23:42:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27360 states. [2025-01-08 23:42:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27360 to 21068. [2025-01-08 23:42:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21068 states, 21067 states have (on average 1.107656524422082) internal successors, (23335), 21067 states have internal predecessors, (23335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21068 states to 21068 states and 23335 transitions. [2025-01-08 23:42:27,977 INFO L78 Accepts]: Start accepts. Automaton has 21068 states and 23335 transitions. Word has length 496 [2025-01-08 23:42:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:27,977 INFO L471 AbstractCegarLoop]: Abstraction has 21068 states and 23335 transitions. [2025-01-08 23:42:27,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 21068 states and 23335 transitions. [2025-01-08 23:42:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-08 23:42:27,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:27,986 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:27,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 23:42:27,986 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:27,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -355696517, now seen corresponding path program 1 times [2025-01-08 23:42:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424273139] [2025-01-08 23:42:27,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:28,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-08 23:42:28,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-08 23:42:28,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:28,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:42:28,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424273139] [2025-01-08 23:42:28,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424273139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:28,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:28,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 23:42:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988610016] [2025-01-08 23:42:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:42:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:28,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:42:28,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:42:28,456 INFO L87 Difference]: Start difference. First operand 21068 states and 23335 transitions. Second operand has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:29,584 INFO L93 Difference]: Finished difference Result 45100 states and 49830 transitions. [2025-01-08 23:42:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:42:29,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 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 500 [2025-01-08 23:42:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:29,611 INFO L225 Difference]: With dead ends: 45100 [2025-01-08 23:42:29,611 INFO L226 Difference]: Without dead ends: 24034 [2025-01-08 23:42:29,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:42:29,627 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 377 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:29,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 91 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:42:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24034 states. [2025-01-08 23:42:29,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24034 to 12212. [2025-01-08 23:42:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12212 states, 12211 states have (on average 1.105151093276554) internal successors, (13495), 12211 states have internal predecessors, (13495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12212 states to 12212 states and 13495 transitions. [2025-01-08 23:42:29,766 INFO L78 Accepts]: Start accepts. Automaton has 12212 states and 13495 transitions. Word has length 500 [2025-01-08 23:42:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:29,766 INFO L471 AbstractCegarLoop]: Abstraction has 12212 states and 13495 transitions. [2025-01-08 23:42:29,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 12212 states and 13495 transitions. [2025-01-08 23:42:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-08 23:42:29,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:29,773 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:29,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 23:42:29,774 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:29,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1135769417, now seen corresponding path program 1 times [2025-01-08 23:42:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557408730] [2025-01-08 23:42:29,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:29,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:29,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-08 23:42:29,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-08 23:42:29,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:29,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-08 23:42:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:30,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557408730] [2025-01-08 23:42:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557408730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:30,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891219257] [2025-01-08 23:42:30,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:30,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:30,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:30,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:30,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:30,288 INFO L87 Difference]: Start difference. First operand 12212 states and 13495 transitions. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:31,270 INFO L93 Difference]: Finished difference Result 28665 states and 31664 transitions. [2025-01-08 23:42:31,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:31,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 517 [2025-01-08 23:42:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:31,288 INFO L225 Difference]: With dead ends: 28665 [2025-01-08 23:42:31,289 INFO L226 Difference]: Without dead ends: 16455 [2025-01-08 23:42:31,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:31,301 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 117 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:31,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 97 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:42:31,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16455 states. [2025-01-08 23:42:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16455 to 15163. [2025-01-08 23:42:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15163 states, 15162 states have (on average 1.1010420788814141) internal successors, (16694), 15162 states have internal predecessors, (16694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 16694 transitions. [2025-01-08 23:42:31,500 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 16694 transitions. Word has length 517 [2025-01-08 23:42:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:31,500 INFO L471 AbstractCegarLoop]: Abstraction has 15163 states and 16694 transitions. [2025-01-08 23:42:31,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 16694 transitions. [2025-01-08 23:42:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-01-08 23:42:31,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:31,517 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:31,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 23:42:31,517 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:31,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:31,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1643837685, now seen corresponding path program 1 times [2025-01-08 23:42:31,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:31,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658652956] [2025-01-08 23:42:31,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:31,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:31,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-01-08 23:42:31,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-01-08 23:42:31,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:31,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 29 proven. 394 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-01-08 23:42:32,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:32,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658652956] [2025-01-08 23:42:32,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658652956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:32,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559846158] [2025-01-08 23:42:32,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:32,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:32,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:32,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:42:32,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:42:32,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-01-08 23:42:32,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-01-08 23:42:32,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:32,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:32,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:42:32,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 29 proven. 394 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-01-08 23:42:32,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:42:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 29 proven. 394 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-01-08 23:42:40,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559846158] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:42:40,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:42:40,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 11 [2025-01-08 23:42:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729186159] [2025-01-08 23:42:40,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:42:40,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 23:42:40,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:40,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 23:42:40,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-08 23:42:40,155 INFO L87 Difference]: Start difference. First operand 15163 states and 16694 transitions. Second operand has 12 states, 12 states have (on average 96.58333333333333) internal successors, (1159), 11 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:44,150 INFO L93 Difference]: Finished difference Result 55596 states and 61224 transitions. [2025-01-08 23:42:44,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-08 23:42:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 96.58333333333333) internal successors, (1159), 11 states have internal predecessors, (1159), 0 states have call successors, (0), 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 555 [2025-01-08 23:42:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:44,186 INFO L225 Difference]: With dead ends: 55596 [2025-01-08 23:42:44,186 INFO L226 Difference]: Without dead ends: 40435 [2025-01-08 23:42:44,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1119 GetRequests, 1102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2025-01-08 23:42:44,198 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 2075 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 3940 mSolverCounterSat, 1115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 5055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1115 IncrementalHoareTripleChecker+Valid, 3940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:44,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 196 Invalid, 5055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1115 Valid, 3940 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:42:44,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40435 states. [2025-01-08 23:42:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40435 to 22537. [2025-01-08 23:42:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22537 states, 22536 states have (on average 1.1022364217252396) internal successors, (24840), 22536 states have internal predecessors, (24840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22537 states to 22537 states and 24840 transitions. [2025-01-08 23:42:44,491 INFO L78 Accepts]: Start accepts. Automaton has 22537 states and 24840 transitions. Word has length 555 [2025-01-08 23:42:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:44,491 INFO L471 AbstractCegarLoop]: Abstraction has 22537 states and 24840 transitions. [2025-01-08 23:42:44,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 96.58333333333333) internal successors, (1159), 11 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 22537 states and 24840 transitions. [2025-01-08 23:42:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2025-01-08 23:42:44,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:44,509 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:44,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:42:44,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:44,710 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:44,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:44,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1435557795, now seen corresponding path program 1 times [2025-01-08 23:42:44,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:44,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256882369] [2025-01-08 23:42:44,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:44,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 824 statements into 1 equivalence classes. [2025-01-08 23:42:44,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 824 of 824 statements. [2025-01-08 23:42:44,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:44,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 1352 proven. 0 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2025-01-08 23:42:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256882369] [2025-01-08 23:42:45,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256882369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:45,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:45,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727819471] [2025-01-08 23:42:45,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:45,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:45,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:45,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:45,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:45,146 INFO L87 Difference]: Start difference. First operand 22537 states and 24840 transitions. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:45,826 INFO L93 Difference]: Finished difference Result 45094 states and 49713 transitions. [2025-01-08 23:42:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:45,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 824 [2025-01-08 23:42:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:45,844 INFO L225 Difference]: With dead ends: 45094 [2025-01-08 23:42:45,844 INFO L226 Difference]: Without dead ends: 22927 [2025-01-08 23:42:45,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:45,851 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 101 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:45,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 144 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22927 states. [2025-01-08 23:42:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22927 to 22353. [2025-01-08 23:42:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22353 states, 22352 states have (on average 1.100080529706514) internal successors, (24589), 22352 states have internal predecessors, (24589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22353 states to 22353 states and 24589 transitions. [2025-01-08 23:42:46,097 INFO L78 Accepts]: Start accepts. Automaton has 22353 states and 24589 transitions. Word has length 824 [2025-01-08 23:42:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:46,098 INFO L471 AbstractCegarLoop]: Abstraction has 22353 states and 24589 transitions. [2025-01-08 23:42:46,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 22353 states and 24589 transitions. [2025-01-08 23:42:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2025-01-08 23:42:46,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:46,120 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:46,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-08 23:42:46,120 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:46,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:46,121 INFO L85 PathProgramCache]: Analyzing trace with hash -902414801, now seen corresponding path program 1 times [2025-01-08 23:42:46,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:46,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956787461] [2025-01-08 23:42:46,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:46,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:46,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 857 statements into 1 equivalence classes. [2025-01-08 23:42:46,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 857 of 857 statements. [2025-01-08 23:42:46,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:46,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 1342 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2025-01-08 23:42:46,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:46,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956787461] [2025-01-08 23:42:46,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956787461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:46,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:46,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975946880] [2025-01-08 23:42:46,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:46,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:46,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:46,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:46,602 INFO L87 Difference]: Start difference. First operand 22353 states and 24589 transitions. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:47,171 INFO L93 Difference]: Finished difference Result 41560 states and 45690 transitions. [2025-01-08 23:42:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:47,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 857 [2025-01-08 23:42:47,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:47,173 INFO L225 Difference]: With dead ends: 41560 [2025-01-08 23:42:47,173 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:42:47,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:47,189 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 74 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:47,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 336 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:42:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:42:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:42:47,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 857 [2025-01-08 23:42:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:47,190 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:42:47,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:42:47,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:42:47,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:42:47,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-08 23:42:47,195 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:47,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.