./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.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 8b118c8ccb1b9404d8245cd33bf194109f3b73174bef011d7daa0d7cc47fcd86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:27:50,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:27:50,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:27:50,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:27:50,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:27:50,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:27:50,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:27:50,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:27:50,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:27:50,718 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:27:50,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:27:50,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:27:50,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:27:50,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:27:50,718 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:27:50,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:27:50,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:27:50,718 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:27:50,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:27:50,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:27:50,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:27:50,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:50,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:27:50,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:27:50,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:50,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:27:50,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:27:50,722 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:27:50,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:27:50,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:27:50,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:27:50,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:27:50,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:27:50,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:27:50,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:27:50,723 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 -> 8b118c8ccb1b9404d8245cd33bf194109f3b73174bef011d7daa0d7cc47fcd86 [2025-01-09 04:27:51,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:27:51,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:27:51,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:27:51,034 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:27:51,035 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:27:51,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c [2025-01-09 04:27:52,367 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a55756e0/a179a3066a194ef8a1d51193f8f149c4/FLAGce2e913e4 [2025-01-09 04:27:52,671 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:27:52,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c [2025-01-09 04:27:52,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a55756e0/a179a3066a194ef8a1d51193f8f149c4/FLAGce2e913e4 [2025-01-09 04:27:52,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a55756e0/a179a3066a194ef8a1d51193f8f149c4 [2025-01-09 04:27:52,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:27:52,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:27:52,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:27:52,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:27:52,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:27:52,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:52" (1/1) ... [2025-01-09 04:27:52,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74af76ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:52, skipping insertion in model container [2025-01-09 04:27:52,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:52" (1/1) ... [2025-01-09 04:27:52,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:27:53,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/seq-mthreaded/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c[31172,31185] [2025-01-09 04:27:53,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:27:53,205 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:27:53,290 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/seq-mthreaded/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c[31172,31185] [2025-01-09 04:27:53,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:27:53,302 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:27:53,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53 WrapperNode [2025-01-09 04:27:53,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:27:53,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:27:53,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:27:53,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:27:53,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,365 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1020 [2025-01-09 04:27:53,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:27:53,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:27:53,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:27:53,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:27:53,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,405 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:27:53,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:27:53,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:27:53,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:27:53,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:27:53,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:53,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:27:53,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:27:53,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:27:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:27:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:27:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:27:53,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:27:53,635 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:27:53,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:27:54,513 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-01-09 04:27:54,513 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:27:54,531 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:27:54,533 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 04:27:54,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:54 BoogieIcfgContainer [2025-01-09 04:27:54,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:27:54,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:27:54,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:27:54,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:27:54,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:27:52" (1/3) ... [2025-01-09 04:27:54,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c145fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:54, skipping insertion in model container [2025-01-09 04:27:54,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (2/3) ... [2025-01-09 04:27:54,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c145fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:54, skipping insertion in model container [2025-01-09 04:27:54,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:54" (3/3) ... [2025-01-09 04:27:54,542 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c [2025-01-09 04:27:54,553 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:27:54,556 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c that has 1 procedures, 307 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:27:54,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:27:54,603 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;@3bf1f8a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:27:54,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:27:54,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 307 states, 305 states have (on average 1.8229508196721311) internal successors, (556), 306 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:27:54,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:54,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:54,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:54,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1546361552, now seen corresponding path program 1 times [2025-01-09 04:27:54,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:54,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913658481] [2025-01-09 04:27:54,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:54,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:54,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:27:54,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:27:54,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:54,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:55,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:55,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913658481] [2025-01-09 04:27:55,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913658481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:55,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:55,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:27:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820683865] [2025-01-09 04:27:55,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:55,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:27:55,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:55,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:27:55,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:27:55,029 INFO L87 Difference]: Start difference. First operand has 307 states, 305 states have (on average 1.8229508196721311) internal successors, (556), 306 states have internal predecessors, (556), 0 states have call successors, (0), 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 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:55,065 INFO L93 Difference]: Finished difference Result 416 states and 748 transitions. [2025-01-09 04:27:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:27:55,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-01-09 04:27:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:55,077 INFO L225 Difference]: With dead ends: 416 [2025-01-09 04:27:55,077 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 04:27:55,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:27:55,083 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:55,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 04:27:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-01-09 04:27:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.8184818481848184) internal successors, (551), 303 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 551 transitions. [2025-01-09 04:27:55,141 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 551 transitions. Word has length 77 [2025-01-09 04:27:55,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:55,143 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 551 transitions. [2025-01-09 04:27:55,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 551 transitions. [2025-01-09 04:27:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:27:55,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:55,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:55,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:27:55,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:55,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:55,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1412348046, now seen corresponding path program 1 times [2025-01-09 04:27:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:55,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116022447] [2025-01-09 04:27:55,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:55,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:27:55,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:27:55,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:55,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:55,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:55,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116022447] [2025-01-09 04:27:55,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116022447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:55,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:55,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:55,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867713220] [2025-01-09 04:27:55,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:55,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:55,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:55,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:55,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:55,579 INFO L87 Difference]: Start difference. First operand 304 states and 551 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:55,817 INFO L93 Difference]: Finished difference Result 416 states and 744 transitions. [2025-01-09 04:27:55,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:55,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-01-09 04:27:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:55,820 INFO L225 Difference]: With dead ends: 416 [2025-01-09 04:27:55,820 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 04:27:55,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:55,826 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 0 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:55,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2145 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:27:55,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 04:27:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-01-09 04:27:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.6666666666666667) internal successors, (505), 303 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 505 transitions. [2025-01-09 04:27:55,851 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 505 transitions. Word has length 77 [2025-01-09 04:27:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:55,851 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 505 transitions. [2025-01-09 04:27:55,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 505 transitions. [2025-01-09 04:27:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:27:55,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:55,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:55,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:27:55,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:55,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:55,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1191940036, now seen corresponding path program 1 times [2025-01-09 04:27:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368727728] [2025-01-09 04:27:55,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:55,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:55,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:27:55,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:27:55,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:55,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:56,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:56,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368727728] [2025-01-09 04:27:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368727728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:56,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:56,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:56,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083491319] [2025-01-09 04:27:56,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:56,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:56,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:56,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:56,114 INFO L87 Difference]: Start difference. First operand 304 states and 505 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:56,187 INFO L93 Difference]: Finished difference Result 508 states and 861 transitions. [2025-01-09 04:27:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:56,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-01-09 04:27:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:56,190 INFO L225 Difference]: With dead ends: 508 [2025-01-09 04:27:56,191 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 04:27:56,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:56,194 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 158 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:56,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 946 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 04:27:56,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 397. [2025-01-09 04:27:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.6767676767676767) internal successors, (664), 396 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 664 transitions. [2025-01-09 04:27:56,216 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 664 transitions. Word has length 122 [2025-01-09 04:27:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:56,216 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 664 transitions. [2025-01-09 04:27:56,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 664 transitions. [2025-01-09 04:27:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 04:27:56,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:56,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:56,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:27:56,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:56,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1589669060, now seen corresponding path program 1 times [2025-01-09 04:27:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:56,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614190163] [2025-01-09 04:27:56,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:56,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 04:27:56,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 04:27:56,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:56,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:56,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:56,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614190163] [2025-01-09 04:27:56,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614190163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:56,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:56,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:56,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095622118] [2025-01-09 04:27:56,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:56,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:56,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:56,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:56,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:56,412 INFO L87 Difference]: Start difference. First operand 397 states and 664 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:56,517 INFO L93 Difference]: Finished difference Result 779 states and 1324 transitions. [2025-01-09 04:27:56,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:56,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-01-09 04:27:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:56,521 INFO L225 Difference]: With dead ends: 779 [2025-01-09 04:27:56,524 INFO L226 Difference]: Without dead ends: 578 [2025-01-09 04:27:56,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:56,526 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 159 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:56,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 959 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-01-09 04:27:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 574. [2025-01-09 04:27:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.6910994764397906) internal successors, (969), 573 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 969 transitions. [2025-01-09 04:27:56,547 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 969 transitions. Word has length 125 [2025-01-09 04:27:56,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:56,547 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 969 transitions. [2025-01-09 04:27:56,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 969 transitions. [2025-01-09 04:27:56,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:27:56,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:56,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:56,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:27:56,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:56,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash 987048560, now seen corresponding path program 1 times [2025-01-09 04:27:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:56,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063962070] [2025-01-09 04:27:56,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:56,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:27:56,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:27:56,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:56,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:56,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:56,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063962070] [2025-01-09 04:27:56,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063962070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:56,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:56,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:56,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868449572] [2025-01-09 04:27:56,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:56,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:56,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:56,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:56,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:56,775 INFO L87 Difference]: Start difference. First operand 574 states and 969 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:56,812 INFO L93 Difference]: Finished difference Result 1290 states and 2203 transitions. [2025-01-09 04:27:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:56,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-01-09 04:27:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:56,817 INFO L225 Difference]: With dead ends: 1290 [2025-01-09 04:27:56,817 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 04:27:56,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:56,819 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 152 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:56,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 960 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 04:27:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 906. [2025-01-09 04:27:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 1.6983425414364641) internal successors, (1537), 905 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1537 transitions. [2025-01-09 04:27:56,842 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1537 transitions. Word has length 128 [2025-01-09 04:27:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:56,842 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1537 transitions. [2025-01-09 04:27:56,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1537 transitions. [2025-01-09 04:27:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:27:56,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:56,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:56,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:27:56,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:56,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:56,845 INFO L85 PathProgramCache]: Analyzing trace with hash 567045616, now seen corresponding path program 1 times [2025-01-09 04:27:56,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:56,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681611036] [2025-01-09 04:27:56,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:56,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:27:56,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:27:56,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:56,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:56,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681611036] [2025-01-09 04:27:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681611036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:56,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:56,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:57,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618079168] [2025-01-09 04:27:57,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:57,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:57,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:57,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:57,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:57,000 INFO L87 Difference]: Start difference. First operand 906 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:57,042 INFO L93 Difference]: Finished difference Result 2246 states and 3835 transitions. [2025-01-09 04:27:57,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:57,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:27:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:57,048 INFO L225 Difference]: With dead ends: 2246 [2025-01-09 04:27:57,048 INFO L226 Difference]: Without dead ends: 1536 [2025-01-09 04:27:57,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:57,049 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 145 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:57,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 961 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-01-09 04:27:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1526. [2025-01-09 04:27:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.6977049180327868) internal successors, (2589), 1525 states have internal predecessors, (2589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2589 transitions. [2025-01-09 04:27:57,080 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2589 transitions. Word has length 131 [2025-01-09 04:27:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:57,080 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 2589 transitions. [2025-01-09 04:27:57,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2589 transitions. [2025-01-09 04:27:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 04:27:57,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:57,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:57,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:27:57,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:57,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:57,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1971495196, now seen corresponding path program 1 times [2025-01-09 04:27:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:57,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183013074] [2025-01-09 04:27:57,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:57,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:57,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 04:27:57,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 04:27:57,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:57,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:57,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:57,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183013074] [2025-01-09 04:27:57,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183013074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:57,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:57,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:27:57,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635111777] [2025-01-09 04:27:57,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:57,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:27:57,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:57,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:27:57,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:27:57,259 INFO L87 Difference]: Start difference. First operand 1526 states and 2589 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:57,506 INFO L93 Difference]: Finished difference Result 7794 states and 13413 transitions. [2025-01-09 04:27:57,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:27:57,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-01-09 04:27:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:57,529 INFO L225 Difference]: With dead ends: 7794 [2025-01-09 04:27:57,529 INFO L226 Difference]: Without dead ends: 6464 [2025-01-09 04:27:57,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:27:57,535 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1634 mSDsluCounter, 3422 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 3922 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:57,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 3922 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:57,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6464 states. [2025-01-09 04:27:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6464 to 2766. [2025-01-09 04:27:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2765 states have (on average 1.7019891500904158) internal successors, (4706), 2765 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4706 transitions. [2025-01-09 04:27:57,670 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4706 transitions. Word has length 134 [2025-01-09 04:27:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:57,671 INFO L471 AbstractCegarLoop]: Abstraction has 2766 states and 4706 transitions. [2025-01-09 04:27:57,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4706 transitions. [2025-01-09 04:27:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 04:27:57,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:57,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:57,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:27:57,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:57,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1107797694, now seen corresponding path program 1 times [2025-01-09 04:27:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:57,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543769687] [2025-01-09 04:27:57,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:57,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 04:27:57,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 04:27:57,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:57,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:57,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:57,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543769687] [2025-01-09 04:27:57,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543769687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:57,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:57,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:57,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412257720] [2025-01-09 04:27:57,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:57,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:57,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:57,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:57,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:57,825 INFO L87 Difference]: Start difference. First operand 2766 states and 4706 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:57,980 INFO L93 Difference]: Finished difference Result 8058 states and 13824 transitions. [2025-01-09 04:27:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:57,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-01-09 04:27:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:57,998 INFO L225 Difference]: With dead ends: 8058 [2025-01-09 04:27:57,998 INFO L226 Difference]: Without dead ends: 5488 [2025-01-09 04:27:58,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:58,003 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 545 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:58,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1620 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:58,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2025-01-09 04:27:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 4110. [2025-01-09 04:27:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4110 states, 4109 states have (on average 1.7057678267218301) internal successors, (7009), 4109 states have internal predecessors, (7009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4110 states to 4110 states and 7009 transitions. [2025-01-09 04:27:58,106 INFO L78 Accepts]: Start accepts. Automaton has 4110 states and 7009 transitions. Word has length 135 [2025-01-09 04:27:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:58,106 INFO L471 AbstractCegarLoop]: Abstraction has 4110 states and 7009 transitions. [2025-01-09 04:27:58,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4110 states and 7009 transitions. [2025-01-09 04:27:58,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 04:27:58,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:58,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:58,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:27:58,109 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:58,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1907592429, now seen corresponding path program 1 times [2025-01-09 04:27:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:58,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97698455] [2025-01-09 04:27:58,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:58,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:58,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 04:27:58,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 04:27:58,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:58,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:58,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:58,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97698455] [2025-01-09 04:27:58,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97698455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:58,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:58,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:58,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133564536] [2025-01-09 04:27:58,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:58,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:58,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:58,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:58,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:58,232 INFO L87 Difference]: Start difference. First operand 4110 states and 7009 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:58,380 INFO L93 Difference]: Finished difference Result 12032 states and 20604 transitions. [2025-01-09 04:27:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:58,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-01-09 04:27:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:58,409 INFO L225 Difference]: With dead ends: 12032 [2025-01-09 04:27:58,409 INFO L226 Difference]: Without dead ends: 8118 [2025-01-09 04:27:58,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:58,417 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 545 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:58,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1624 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8118 states. [2025-01-09 04:27:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8118 to 6090. [2025-01-09 04:27:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6090 states, 6089 states have (on average 1.7032353424207587) internal successors, (10371), 6089 states have internal predecessors, (10371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 10371 transitions. [2025-01-09 04:27:58,601 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 10371 transitions. Word has length 136 [2025-01-09 04:27:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:58,601 INFO L471 AbstractCegarLoop]: Abstraction has 6090 states and 10371 transitions. [2025-01-09 04:27:58,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 10371 transitions. [2025-01-09 04:27:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:27:58,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:58,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:58,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:27:58,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:58,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:58,606 INFO L85 PathProgramCache]: Analyzing trace with hash -762421095, now seen corresponding path program 1 times [2025-01-09 04:27:58,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:58,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514085331] [2025-01-09 04:27:58,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:58,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:58,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:27:58,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:27:58,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:58,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:58,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514085331] [2025-01-09 04:27:58,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514085331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:58,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:58,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:58,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738875421] [2025-01-09 04:27:58,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:58,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:58,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:58,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:58,776 INFO L87 Difference]: Start difference. First operand 6090 states and 10371 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:58,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:58,942 INFO L93 Difference]: Finished difference Result 17912 states and 30612 transitions. [2025-01-09 04:27:58,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:58,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-01-09 04:27:58,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:58,967 INFO L225 Difference]: With dead ends: 17912 [2025-01-09 04:27:58,967 INFO L226 Difference]: Without dead ends: 12018 [2025-01-09 04:27:58,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:58,978 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 543 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:58,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1619 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12018 states. [2025-01-09 04:27:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12018 to 9020. [2025-01-09 04:27:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9020 states, 9019 states have (on average 1.700299368000887) internal successors, (15335), 9019 states have internal predecessors, (15335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9020 states to 9020 states and 15335 transitions. [2025-01-09 04:27:59,288 INFO L78 Accepts]: Start accepts. Automaton has 9020 states and 15335 transitions. Word has length 137 [2025-01-09 04:27:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:59,288 INFO L471 AbstractCegarLoop]: Abstraction has 9020 states and 15335 transitions. [2025-01-09 04:27:59,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 9020 states and 15335 transitions. [2025-01-09 04:27:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 04:27:59,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:59,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:59,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:27:59,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:59,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash 943729454, now seen corresponding path program 1 times [2025-01-09 04:27:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:59,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061550495] [2025-01-09 04:27:59,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:59,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:59,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 04:27:59,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 04:27:59,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:59,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:59,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:59,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061550495] [2025-01-09 04:27:59,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061550495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:59,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:59,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940743811] [2025-01-09 04:27:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:59,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:59,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:59,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:59,409 INFO L87 Difference]: Start difference. First operand 9020 states and 15335 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:59,528 INFO L93 Difference]: Finished difference Result 20156 states and 34268 transitions. [2025-01-09 04:27:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-01-09 04:27:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:59,561 INFO L225 Difference]: With dead ends: 20156 [2025-01-09 04:27:59,561 INFO L226 Difference]: Without dead ends: 13938 [2025-01-09 04:27:59,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:59,573 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 158 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:59,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1090 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13938 states. [2025-01-09 04:27:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13938 to 13936. [2025-01-09 04:27:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13936 states, 13935 states have (on average 1.6907068532472191) internal successors, (23560), 13935 states have internal predecessors, (23560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13936 states to 13936 states and 23560 transitions. [2025-01-09 04:27:59,868 INFO L78 Accepts]: Start accepts. Automaton has 13936 states and 23560 transitions. Word has length 138 [2025-01-09 04:27:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:59,869 INFO L471 AbstractCegarLoop]: Abstraction has 13936 states and 23560 transitions. [2025-01-09 04:27:59,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 13936 states and 23560 transitions. [2025-01-09 04:27:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 04:27:59,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:59,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:59,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:27:59,871 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:59,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:59,871 INFO L85 PathProgramCache]: Analyzing trace with hash 547156234, now seen corresponding path program 1 times [2025-01-09 04:27:59,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:59,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821122309] [2025-01-09 04:27:59,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:59,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 04:27:59,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 04:27:59,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:59,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:28:00,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:00,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821122309] [2025-01-09 04:28:00,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821122309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:00,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:00,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:28:00,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329252055] [2025-01-09 04:28:00,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:00,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:28:00,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:00,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:28:00,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:28:00,086 INFO L87 Difference]: Start difference. First operand 13936 states and 23560 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:00,300 INFO L93 Difference]: Finished difference Result 41248 states and 69967 transitions. [2025-01-09 04:28:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:28:00,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-01-09 04:28:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:00,367 INFO L225 Difference]: With dead ends: 41248 [2025-01-09 04:28:00,367 INFO L226 Difference]: Without dead ends: 27540 [2025-01-09 04:28:00,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:28:00,395 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 541 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:00,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1631 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27540 states. [2025-01-09 04:28:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27540 to 20658. [2025-01-09 04:28:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20658 states, 20657 states have (on average 1.6871762598634845) internal successors, (34852), 20657 states have internal predecessors, (34852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20658 states to 20658 states and 34852 transitions. [2025-01-09 04:28:00,947 INFO L78 Accepts]: Start accepts. Automaton has 20658 states and 34852 transitions. Word has length 138 [2025-01-09 04:28:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:00,947 INFO L471 AbstractCegarLoop]: Abstraction has 20658 states and 34852 transitions. [2025-01-09 04:28:00,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 20658 states and 34852 transitions. [2025-01-09 04:28:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 04:28:00,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:00,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:00,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:28:00,951 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:00,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1812525742, now seen corresponding path program 1 times [2025-01-09 04:28:00,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:00,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477856850] [2025-01-09 04:28:00,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:00,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:01,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 04:28:01,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 04:28:01,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:01,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:28:01,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:01,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477856850] [2025-01-09 04:28:01,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477856850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:01,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:01,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:28:01,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073753568] [2025-01-09 04:28:01,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:01,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:28:01,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:01,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:28:01,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:01,147 INFO L87 Difference]: Start difference. First operand 20658 states and 34852 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:01,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:01,517 INFO L93 Difference]: Finished difference Result 46520 states and 78428 transitions. [2025-01-09 04:28:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:28:01,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-01-09 04:28:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:01,607 INFO L225 Difference]: With dead ends: 46520 [2025-01-09 04:28:01,607 INFO L226 Difference]: Without dead ends: 32018 [2025-01-09 04:28:01,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:01,642 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 144 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:01,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1039 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32018 states. [2025-01-09 04:28:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32018 to 32016. [2025-01-09 04:28:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32016 states, 32015 states have (on average 1.6751522723723256) internal successors, (53630), 32015 states have internal predecessors, (53630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32016 states to 32016 states and 53630 transitions. [2025-01-09 04:28:02,457 INFO L78 Accepts]: Start accepts. Automaton has 32016 states and 53630 transitions. Word has length 138 [2025-01-09 04:28:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:02,458 INFO L471 AbstractCegarLoop]: Abstraction has 32016 states and 53630 transitions. [2025-01-09 04:28:02,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:02,458 INFO L276 IsEmpty]: Start isEmpty. Operand 32016 states and 53630 transitions. [2025-01-09 04:28:02,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 04:28:02,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:02,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:02,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:28:02,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:02,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1447992394, now seen corresponding path program 1 times [2025-01-09 04:28:02,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:02,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503000534] [2025-01-09 04:28:02,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:02,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:02,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 04:28:02,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 04:28:02,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:02,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:28:02,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:02,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503000534] [2025-01-09 04:28:02,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503000534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:02,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:02,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:28:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872406706] [2025-01-09 04:28:02,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:02,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:28:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:02,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:28:02,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:02,546 INFO L87 Difference]: Start difference. First operand 32016 states and 53630 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:03,086 INFO L93 Difference]: Finished difference Result 71444 states and 119580 transitions. [2025-01-09 04:28:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:28:03,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-01-09 04:28:03,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:03,194 INFO L225 Difference]: With dead ends: 71444 [2025-01-09 04:28:03,194 INFO L226 Difference]: Without dead ends: 48902 [2025-01-09 04:28:03,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:03,217 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 151 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:03,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1075 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48902 states. [2025-01-09 04:28:03,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48902 to 48900. [2025-01-09 04:28:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48900 states, 48899 states have (on average 1.6619562772244831) internal successors, (81268), 48899 states have internal predecessors, (81268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48900 states to 48900 states and 81268 transitions. [2025-01-09 04:28:04,172 INFO L78 Accepts]: Start accepts. Automaton has 48900 states and 81268 transitions. Word has length 138 [2025-01-09 04:28:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:04,172 INFO L471 AbstractCegarLoop]: Abstraction has 48900 states and 81268 transitions. [2025-01-09 04:28:04,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 48900 states and 81268 transitions. [2025-01-09 04:28:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 04:28:04,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:04,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:04,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:28:04,174 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:04,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash -526462006, now seen corresponding path program 1 times [2025-01-09 04:28:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:04,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612456096] [2025-01-09 04:28:04,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:04,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:04,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 04:28:04,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 04:28:04,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:04,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:28:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:04,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612456096] [2025-01-09 04:28:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612456096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:04,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:28:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037886146] [2025-01-09 04:28:04,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:04,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:28:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:04,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:28:04,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:04,280 INFO L87 Difference]: Start difference. First operand 48900 states and 81268 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:05,066 INFO L93 Difference]: Finished difference Result 110025 states and 183600 transitions. [2025-01-09 04:28:05,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:28:05,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-01-09 04:28:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:05,200 INFO L225 Difference]: With dead ends: 110025 [2025-01-09 04:28:05,201 INFO L226 Difference]: Without dead ends: 74764 [2025-01-09 04:28:05,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:05,230 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 165 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:05,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74764 states. [2025-01-09 04:28:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74764 to 74762. [2025-01-09 04:28:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74762 states, 74761 states have (on average 1.6525193616992817) internal successors, (123544), 74761 states have internal predecessors, (123544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74762 states to 74762 states and 123544 transitions. [2025-01-09 04:28:06,422 INFO L78 Accepts]: Start accepts. Automaton has 74762 states and 123544 transitions. Word has length 138 [2025-01-09 04:28:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:06,422 INFO L471 AbstractCegarLoop]: Abstraction has 74762 states and 123544 transitions. [2025-01-09 04:28:06,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 74762 states and 123544 transitions. [2025-01-09 04:28:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 04:28:06,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:06,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:06,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:28:06,424 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:06,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash -385019198, now seen corresponding path program 1 times [2025-01-09 04:28:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:06,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834450485] [2025-01-09 04:28:06,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:06,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:06,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 04:28:06,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 04:28:06,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:06,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:28:06,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:06,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834450485] [2025-01-09 04:28:06,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834450485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:06,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:06,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:06,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585393097] [2025-01-09 04:28:06,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:06,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:06,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:06,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:06,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:06,872 INFO L87 Difference]: Start difference. First operand 74762 states and 123544 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:07,796 INFO L93 Difference]: Finished difference Result 149298 states and 246723 transitions. [2025-01-09 04:28:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:07,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-01-09 04:28:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:07,911 INFO L225 Difference]: With dead ends: 149298 [2025-01-09 04:28:07,911 INFO L226 Difference]: Without dead ends: 74764 [2025-01-09 04:28:07,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:28:07,950 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 444 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:07,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1898 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74764 states. [2025-01-09 04:28:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74764 to 74762. [2025-01-09 04:28:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74762 states, 74761 states have (on average 1.6441593879161596) internal successors, (122919), 74761 states have internal predecessors, (122919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74762 states to 74762 states and 122919 transitions. [2025-01-09 04:28:09,231 INFO L78 Accepts]: Start accepts. Automaton has 74762 states and 122919 transitions. Word has length 140 [2025-01-09 04:28:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:09,231 INFO L471 AbstractCegarLoop]: Abstraction has 74762 states and 122919 transitions. [2025-01-09 04:28:09,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 74762 states and 122919 transitions. [2025-01-09 04:28:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 04:28:09,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:09,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:09,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:28:09,233 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:09,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash 703411196, now seen corresponding path program 1 times [2025-01-09 04:28:09,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:09,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111945341] [2025-01-09 04:28:09,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:09,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:09,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 04:28:09,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 04:28:09,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:09,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:28:09,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:09,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111945341] [2025-01-09 04:28:09,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111945341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:09,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:09,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:09,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124978705] [2025-01-09 04:28:09,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:09,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:09,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:09,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:09,501 INFO L87 Difference]: Start difference. First operand 74762 states and 122919 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 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-09 04:28:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:10,866 INFO L93 Difference]: Finished difference Result 218656 states and 359935 transitions. [2025-01-09 04:28:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:10,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 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-09 04:28:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:11,124 INFO L225 Difference]: With dead ends: 218656 [2025-01-09 04:28:11,125 INFO L226 Difference]: Without dead ends: 144122 [2025-01-09 04:28:11,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:28:11,189 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 583 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:11,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1905 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144122 states. [2025-01-09 04:28:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144122 to 144120. [2025-01-09 04:28:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144120 states, 144119 states have (on average 1.633122627828392) internal successors, (235364), 144119 states have internal predecessors, (235364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144120 states to 144120 states and 235364 transitions. [2025-01-09 04:28:13,977 INFO L78 Accepts]: Start accepts. Automaton has 144120 states and 235364 transitions. Word has length 143 [2025-01-09 04:28:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:13,977 INFO L471 AbstractCegarLoop]: Abstraction has 144120 states and 235364 transitions. [2025-01-09 04:28:13,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 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-09 04:28:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 144120 states and 235364 transitions. [2025-01-09 04:28:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 04:28:13,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:13,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:13,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:28:13,979 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:13,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash -100434709, now seen corresponding path program 1 times [2025-01-09 04:28:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:13,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751588157] [2025-01-09 04:28:13,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:13,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 04:28:14,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 04:28:14,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:14,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:28:14,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:14,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751588157] [2025-01-09 04:28:14,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751588157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:14,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:14,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:28:14,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931940393] [2025-01-09 04:28:14,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:14,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:28:14,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:14,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:28:14,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:28:14,324 INFO L87 Difference]: Start difference. First operand 144120 states and 235364 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:15,634 INFO L93 Difference]: Finished difference Result 149930 states and 243109 transitions. [2025-01-09 04:28:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:28:15,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-01-09 04:28:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:15,891 INFO L225 Difference]: With dead ends: 149930 [2025-01-09 04:28:15,892 INFO L226 Difference]: Without dead ends: 149928 [2025-01-09 04:28:15,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:28:15,927 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:15,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1993 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149928 states. [2025-01-09 04:28:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149928 to 149928. [2025-01-09 04:28:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149928 states, 149927 states have (on average 1.6084160958333056) internal successors, (241145), 149927 states have internal predecessors, (241145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149928 states to 149928 states and 241145 transitions. [2025-01-09 04:28:18,721 INFO L78 Accepts]: Start accepts. Automaton has 149928 states and 241145 transitions. Word has length 144 [2025-01-09 04:28:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:18,721 INFO L471 AbstractCegarLoop]: Abstraction has 149928 states and 241145 transitions. [2025-01-09 04:28:18,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 149928 states and 241145 transitions. [2025-01-09 04:28:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 04:28:18,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:18,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:18,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:28:18,724 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:18,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:18,725 INFO L85 PathProgramCache]: Analyzing trace with hash 398037157, now seen corresponding path program 1 times [2025-01-09 04:28:18,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:18,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534376441] [2025-01-09 04:28:18,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:18,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:18,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 04:28:18,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 04:28:18,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:18,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:28:18,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:18,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534376441] [2025-01-09 04:28:18,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534376441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:18,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:18,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952648728] [2025-01-09 04:28:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:18,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:18,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:18,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:18,964 INFO L87 Difference]: Start difference. First operand 149928 states and 241145 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 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-09 04:28:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:22,289 INFO L93 Difference]: Finished difference Result 411998 states and 664362 transitions. [2025-01-09 04:28:22,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:22,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 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 182 [2025-01-09 04:28:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:22,989 INFO L225 Difference]: With dead ends: 411998 [2025-01-09 04:28:22,989 INFO L226 Difference]: Without dead ends: 345496 [2025-01-09 04:28:23,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:28:23,091 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 1216 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:23,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 2507 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345496 states. [2025-01-09 04:28:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345496 to 241644. [2025-01-09 04:28:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241644 states, 241643 states have (on average 1.6057862218231027) internal successors, (388027), 241643 states have internal predecessors, (388027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241644 states to 241644 states and 388027 transitions. [2025-01-09 04:28:28,687 INFO L78 Accepts]: Start accepts. Automaton has 241644 states and 388027 transitions. Word has length 182 [2025-01-09 04:28:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:28,688 INFO L471 AbstractCegarLoop]: Abstraction has 241644 states and 388027 transitions. [2025-01-09 04:28:28,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 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-09 04:28:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 241644 states and 388027 transitions. [2025-01-09 04:28:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 04:28:28,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:28,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:28:28,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:28:28,692 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:28,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1266833445, now seen corresponding path program 1 times [2025-01-09 04:28:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:28,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805893669] [2025-01-09 04:28:28,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:28,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:28,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 04:28:28,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 04:28:28,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:28,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 04:28:28,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:28,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805893669] [2025-01-09 04:28:28,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805893669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:28,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:28,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:28,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064873472] [2025-01-09 04:28:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:28,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:28,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:28,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:28,862 INFO L87 Difference]: Start difference. First operand 241644 states and 388027 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:28:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:32,384 INFO L93 Difference]: Finished difference Result 454750 states and 733478 transitions. [2025-01-09 04:28:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:32,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 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 182 [2025-01-09 04:28:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:33,093 INFO L225 Difference]: With dead ends: 454750 [2025-01-09 04:28:33,094 INFO L226 Difference]: Without dead ends: 388248 [2025-01-09 04:28:33,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:28:33,238 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 1168 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:33,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 2506 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:33,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388248 states.