./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.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 5f8c8484e54a4d715d6771fe823761e162b84321aa9b0770845c5d1629fcdad3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:00:43,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:00:43,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:00:43,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:00:43,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:00:43,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:00:43,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:00:43,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:00:43,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:00:43,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:00:43,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:00:43,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:00:43,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:00:43,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:00:43,852 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:00:43,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:00:43,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:00:43,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:00:43,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:00:43,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:00:43,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:00:43,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:00:43,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:00:43,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:00:43,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:00:43,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:00:43,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:00:43,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:00:43,854 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:00:43,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:00:43,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:00:43,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:00:43,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:00:43,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:00:43,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:00:43,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:00:43,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:00:43,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:00:43,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:00:43,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:00:43,855 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:00:43,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:00:43,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:00:43,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:00:43,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:00:43,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:00:43,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:00:43,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:00:43,855 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 -> 5f8c8484e54a4d715d6771fe823761e162b84321aa9b0770845c5d1629fcdad3 [2025-01-09 06:00:44,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:00:44,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:00:44,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:00:44,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:00:44,176 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:00:44,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 06:00:45,592 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a816c1cd/7b67320cbc564ebf87160f388c42709d/FLAGa828516f5 [2025-01-09 06:00:46,278 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:00:46,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 06:00:46,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a816c1cd/7b67320cbc564ebf87160f388c42709d/FLAGa828516f5 [2025-01-09 06:00:46,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a816c1cd/7b67320cbc564ebf87160f388c42709d [2025-01-09 06:00:46,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:00:46,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:00:46,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:00:46,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:00:46,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:00:46,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:00:46" (1/1) ... [2025-01-09 06:00:46,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c8c058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:46, skipping insertion in model container [2025-01-09 06:00:46,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:00:46" (1/1) ... [2025-01-09 06:00:46,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:00:46,948 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.c[26888,26901] [2025-01-09 06:00:47,017 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.c[33824,33837] [2025-01-09 06:00:47,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:00:47,558 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:00:47,605 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.c[26888,26901] [2025-01-09 06:00:47,613 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.c[33824,33837] [2025-01-09 06:00:47,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:00:48,004 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:00:48,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48 WrapperNode [2025-01-09 06:00:48,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:00:48,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:00:48,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:00:48,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:00:48,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:48,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:48,465 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5285 [2025-01-09 06:00:48,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:00:48,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:00:48,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:00:48,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:00:48,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:48,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:48,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:48,765 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 06:00:48,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:48,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:48,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:48,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:48,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:48,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:49,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:49,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:00:49,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:00:49,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:00:49,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:00:49,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (1/1) ... [2025-01-09 06:00:49,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:00:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:00:49,125 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 06:00:49,129 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 06:00:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:00:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:00:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:00:49,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:00:49,304 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:00:49,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:00:54,382 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2025-01-09 06:00:54,383 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:00:54,423 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:00:54,423 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 06:00:54,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:00:54 BoogieIcfgContainer [2025-01-09 06:00:54,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:00:54,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:00:54,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:00:54,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:00:54,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:00:46" (1/3) ... [2025-01-09 06:00:54,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608c400d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:00:54, skipping insertion in model container [2025-01-09 06:00:54,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:00:48" (2/3) ... [2025-01-09 06:00:54,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608c400d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:00:54, skipping insertion in model container [2025-01-09 06:00:54,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:00:54" (3/3) ... [2025-01-09 06:00:54,438 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 06:00:54,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:00:54,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 948 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 06:00:54,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:00:54,571 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;@7279b201, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:00:54,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:00:54,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 948 states, 945 states have (on average 1.9015873015873015) internal successors, (1797), 947 states have internal predecessors, (1797), 0 states have call successors, (0), 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 06:00:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 06:00:54,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:00:54,592 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] [2025-01-09 06:00:54,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:00:54,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:00:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1459399979, now seen corresponding path program 1 times [2025-01-09 06:00:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:00:54,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305886014] [2025-01-09 06:00:54,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:00:54,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:00:54,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 06:00:54,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 06:00:54,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:00:54,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:00:55,070 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 06:00:55,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:00:55,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305886014] [2025-01-09 06:00:55,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305886014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:00:55,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:00:55,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 06:00:55,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285026823] [2025-01-09 06:00:55,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:00:55,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 06:00:55,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:00:55,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 06:00:55,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 06:00:55,107 INFO L87 Difference]: Start difference. First operand has 948 states, 945 states have (on average 1.9015873015873015) internal successors, (1797), 947 states have internal predecessors, (1797), 0 states have call successors, (0), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 06:00:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:00:55,189 INFO L93 Difference]: Finished difference Result 1828 states and 3463 transitions. [2025-01-09 06:00:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 06:00:55,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-01-09 06:00:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:00:55,220 INFO L225 Difference]: With dead ends: 1828 [2025-01-09 06:00:55,220 INFO L226 Difference]: Without dead ends: 883 [2025-01-09 06:00:55,231 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 06:00:55,236 INFO L435 NwaCegarLoop]: 1731 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, 1731 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 06:00:55,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:00:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-01-09 06:00:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-01-09 06:00:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8921679909194098) internal successors, (1667), 882 states have internal predecessors, (1667), 0 states have call successors, (0), 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 06:00:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1667 transitions. [2025-01-09 06:00:55,333 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1667 transitions. Word has length 30 [2025-01-09 06:00:55,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:00:55,333 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1667 transitions. [2025-01-09 06:00:55,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 06:00:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1667 transitions. [2025-01-09 06:00:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 06:00:55,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:00:55,335 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] [2025-01-09 06:00:55,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:00:55,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:00:55,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:00:55,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1593413485, now seen corresponding path program 1 times [2025-01-09 06:00:55,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:00:55,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233768394] [2025-01-09 06:00:55,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:00:55,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:00:55,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 06:00:55,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 06:00:55,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:00:55,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:00:55,681 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 06:00:55,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:00:55,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233768394] [2025-01-09 06:00:55,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233768394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:00:55,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:00:55,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:00:55,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023229884] [2025-01-09 06:00:55,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:00:55,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:00:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:00:55,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:00:55,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:00:55,685 INFO L87 Difference]: Start difference. First operand 883 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 06:00:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:00:55,847 INFO L93 Difference]: Finished difference Result 949 states and 1771 transitions. [2025-01-09 06:00:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:00:55,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-01-09 06:00:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:00:55,854 INFO L225 Difference]: With dead ends: 949 [2025-01-09 06:00:55,854 INFO L226 Difference]: Without dead ends: 883 [2025-01-09 06:00:55,855 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 06:00:55,857 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 0 mSDsluCounter, 4929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6594 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:00:55,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6594 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:00:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-01-09 06:00:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-01-09 06:00:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8229284903518728) internal successors, (1606), 882 states have internal predecessors, (1606), 0 states have call successors, (0), 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 06:00:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1606 transitions. [2025-01-09 06:00:55,895 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1606 transitions. Word has length 30 [2025-01-09 06:00:55,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:00:55,896 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1606 transitions. [2025-01-09 06:00:55,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 06:00:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1606 transitions. [2025-01-09 06:00:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 06:00:55,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:00:55,902 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] [2025-01-09 06:00:55,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:00:55,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:00:55,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:00:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1817953728, now seen corresponding path program 1 times [2025-01-09 06:00:55,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:00:55,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444745802] [2025-01-09 06:00:55,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:00:55,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:00:55,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 06:00:55,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 06:00:55,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:00:55,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:00:56,107 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 06:00:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:00:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444745802] [2025-01-09 06:00:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444745802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:00:56,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:00:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 06:00:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640729836] [2025-01-09 06:00:56,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:00:56,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:00:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:00:56,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:00:56,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:00:56,111 INFO L87 Difference]: Start difference. First operand 883 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 06:00:59,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:00:59,763 INFO L93 Difference]: Finished difference Result 2387 states and 4479 transitions. [2025-01-09 06:00:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:00:59,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-01-09 06:00:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:00:59,773 INFO L225 Difference]: With dead ends: 2387 [2025-01-09 06:00:59,773 INFO L226 Difference]: Without dead ends: 1634 [2025-01-09 06:00:59,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:00:59,779 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 908 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:00:59,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 642 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 06:00:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-01-09 06:00:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2025-01-09 06:00:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.5839460784313726) internal successors, (2585), 1633 states have internal predecessors, (2585), 0 states have call successors, (0), 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 06:00:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2585 transitions. [2025-01-09 06:00:59,840 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2585 transitions. Word has length 60 [2025-01-09 06:00:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:00:59,841 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2585 transitions. [2025-01-09 06:00:59,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 06:00:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2585 transitions. [2025-01-09 06:00:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 06:00:59,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:00:59,847 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] [2025-01-09 06:00:59,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:00:59,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:00:59,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:00:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1143215165, now seen corresponding path program 1 times [2025-01-09 06:00:59,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:00:59,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593062310] [2025-01-09 06:00:59,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:00:59,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:00:59,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 06:00:59,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 06:00:59,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:00:59,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:00,387 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 06:01:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593062310] [2025-01-09 06:01:00,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593062310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:00,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:00,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729032130] [2025-01-09 06:01:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:00,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:00,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:00,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:00,390 INFO L87 Difference]: Start difference. First operand 1634 states and 2585 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 06:01:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:00,954 INFO L93 Difference]: Finished difference Result 2626 states and 4185 transitions. [2025-01-09 06:01:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 06:01:00,955 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-01-09 06:01:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:00,971 INFO L225 Difference]: With dead ends: 2626 [2025-01-09 06:01:00,971 INFO L226 Difference]: Without dead ends: 2564 [2025-01-09 06:01:00,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-01-09 06:01:00,975 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 13580 mSDsluCounter, 3646 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13580 SdHoareTripleChecker+Valid, 5246 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:00,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13580 Valid, 5246 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:01:00,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2025-01-09 06:01:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1694. [2025-01-09 06:01:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1692 states have (on average 1.5851063829787233) internal successors, (2682), 1693 states have internal predecessors, (2682), 0 states have call successors, (0), 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 06:01:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2682 transitions. [2025-01-09 06:01:01,039 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2682 transitions. Word has length 90 [2025-01-09 06:01:01,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:01,041 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 2682 transitions. [2025-01-09 06:01:01,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 06:01:01,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2682 transitions. [2025-01-09 06:01:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 06:01:01,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:01,043 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] [2025-01-09 06:01:01,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:01:01,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:01,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash -467340741, now seen corresponding path program 1 times [2025-01-09 06:01:01,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:01,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013684408] [2025-01-09 06:01:01,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:01,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:01,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 06:01:01,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 06:01:01,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:01,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:01,684 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 06:01:01,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:01,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013684408] [2025-01-09 06:01:01,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013684408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:01,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:01,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:01,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878696248] [2025-01-09 06:01:01,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:01,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:01,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:01,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:01,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:01,686 INFO L87 Difference]: Start difference. First operand 1694 states and 2682 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 06:01:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:02,180 INFO L93 Difference]: Finished difference Result 1818 states and 2880 transitions. [2025-01-09 06:01:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:01:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 06:01:02,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:02,190 INFO L225 Difference]: With dead ends: 1818 [2025-01-09 06:01:02,191 INFO L226 Difference]: Without dead ends: 1696 [2025-01-09 06:01:02,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-01-09 06:01:02,193 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 10647 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10647 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:02,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10647 Valid, 2278 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:01:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2025-01-09 06:01:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1694. [2025-01-09 06:01:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1692 states have (on average 1.58451536643026) internal successors, (2681), 1693 states have internal predecessors, (2681), 0 states have call successors, (0), 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 06:01:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2681 transitions. [2025-01-09 06:01:02,248 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2681 transitions. Word has length 92 [2025-01-09 06:01:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:02,248 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 2681 transitions. [2025-01-09 06:01:02,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 06:01:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2681 transitions. [2025-01-09 06:01:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 06:01:02,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:02,250 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] [2025-01-09 06:01:02,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:01:02,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:02,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash -533834253, now seen corresponding path program 1 times [2025-01-09 06:01:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186014534] [2025-01-09 06:01:02,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:02,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 06:01:02,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 06:01:02,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:02,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:02,461 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 06:01:02,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:02,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186014534] [2025-01-09 06:01:02,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186014534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:02,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:02,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:02,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720053420] [2025-01-09 06:01:02,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:02,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:02,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:02,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:02,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:02,464 INFO L87 Difference]: Start difference. First operand 1694 states and 2681 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 06:01:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:02,508 INFO L93 Difference]: Finished difference Result 1927 states and 3054 transitions. [2025-01-09 06:01:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:02,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 06:01:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:02,517 INFO L225 Difference]: With dead ends: 1927 [2025-01-09 06:01:02,517 INFO L226 Difference]: Without dead ends: 1805 [2025-01-09 06:01:02,518 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 06:01:02,520 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1508 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:02,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1695 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2025-01-09 06:01:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1801. [2025-01-09 06:01:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 1.584213451917732) internal successors, (2850), 1800 states have internal predecessors, (2850), 0 states have call successors, (0), 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 06:01:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2850 transitions. [2025-01-09 06:01:02,577 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2850 transitions. Word has length 92 [2025-01-09 06:01:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:02,578 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2850 transitions. [2025-01-09 06:01:02,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 06:01:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2850 transitions. [2025-01-09 06:01:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 06:01:02,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:02,580 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] [2025-01-09 06:01:02,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:01:02,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:02,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2017383902, now seen corresponding path program 1 times [2025-01-09 06:01:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:02,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128456091] [2025-01-09 06:01:02,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:02,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 06:01:02,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 06:01:02,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:02,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:02,912 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 06:01:02,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:02,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128456091] [2025-01-09 06:01:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128456091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:02,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:02,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:01:02,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354416202] [2025-01-09 06:01:02,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:02,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:01:02,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:02,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:01:02,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:01:02,915 INFO L87 Difference]: Start difference. First operand 1801 states and 2850 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 06:01:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:02,957 INFO L93 Difference]: Finished difference Result 1809 states and 2859 transitions. [2025-01-09 06:01:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:01:02,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 06:01:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:02,966 INFO L225 Difference]: With dead ends: 1809 [2025-01-09 06:01:02,967 INFO L226 Difference]: Without dead ends: 1807 [2025-01-09 06:01:02,968 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 06:01:02,969 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4800 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6403 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:02,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6403 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2025-01-09 06:01:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1807. [2025-01-09 06:01:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1805 states have (on average 1.5817174515235457) internal successors, (2855), 1806 states have internal predecessors, (2855), 0 states have call successors, (0), 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 06:01:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2855 transitions. [2025-01-09 06:01:03,019 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2855 transitions. Word has length 93 [2025-01-09 06:01:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:03,021 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2855 transitions. [2025-01-09 06:01:03,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 06:01:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2855 transitions. [2025-01-09 06:01:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:03,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:03,022 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] [2025-01-09 06:01:03,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:01:03,023 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:03,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash 154071291, now seen corresponding path program 1 times [2025-01-09 06:01:03,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:03,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727068540] [2025-01-09 06:01:03,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:03,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:03,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:03,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:03,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:03,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:03,125 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 06:01:03,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:03,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727068540] [2025-01-09 06:01:03,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727068540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:03,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:03,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:03,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704561290] [2025-01-09 06:01:03,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:03,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:03,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:03,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:03,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:03,128 INFO L87 Difference]: Start difference. First operand 1807 states and 2855 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:03,166 INFO L93 Difference]: Finished difference Result 2261 states and 3567 transitions. [2025-01-09 06:01:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:03,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 06:01:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:03,175 INFO L225 Difference]: With dead ends: 2261 [2025-01-09 06:01:03,175 INFO L226 Difference]: Without dead ends: 2026 [2025-01-09 06:01:03,177 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 06:01:03,177 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 1527 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:03,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2025-01-09 06:01:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2024. [2025-01-09 06:01:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 2022 states have (on average 1.5786350148367954) internal successors, (3192), 2023 states have internal predecessors, (3192), 0 states have call successors, (0), 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 06:01:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 3192 transitions. [2025-01-09 06:01:03,231 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 3192 transitions. Word has length 94 [2025-01-09 06:01:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:03,231 INFO L471 AbstractCegarLoop]: Abstraction has 2024 states and 3192 transitions. [2025-01-09 06:01:03,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 3192 transitions. [2025-01-09 06:01:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:03,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:03,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] [2025-01-09 06:01:03,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:01:03,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:03,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2035911941, now seen corresponding path program 1 times [2025-01-09 06:01:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349743639] [2025-01-09 06:01:03,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:03,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:03,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:03,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:03,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:03,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:03,329 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 06:01:03,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:03,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349743639] [2025-01-09 06:01:03,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349743639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:03,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:03,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:03,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284668549] [2025-01-09 06:01:03,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:03,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:03,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:03,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:03,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:03,331 INFO L87 Difference]: Start difference. First operand 2024 states and 3192 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:03,367 INFO L93 Difference]: Finished difference Result 2896 states and 4550 transitions. [2025-01-09 06:01:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:03,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 06:01:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:03,378 INFO L225 Difference]: With dead ends: 2896 [2025-01-09 06:01:03,378 INFO L226 Difference]: Without dead ends: 2444 [2025-01-09 06:01:03,380 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 06:01:03,381 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 1523 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:03,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:03,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2025-01-09 06:01:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2442. [2025-01-09 06:01:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.571311475409836) internal successors, (3834), 2441 states have internal predecessors, (3834), 0 states have call successors, (0), 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 06:01:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3834 transitions. [2025-01-09 06:01:03,451 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3834 transitions. Word has length 94 [2025-01-09 06:01:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:03,451 INFO L471 AbstractCegarLoop]: Abstraction has 2442 states and 3834 transitions. [2025-01-09 06:01:03,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3834 transitions. [2025-01-09 06:01:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:03,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:03,452 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] [2025-01-09 06:01:03,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:01:03,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:03,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1772055557, now seen corresponding path program 1 times [2025-01-09 06:01:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:03,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197314891] [2025-01-09 06:01:03,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:03,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:03,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:03,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:03,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:03,546 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 06:01:03,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:03,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197314891] [2025-01-09 06:01:03,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197314891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:03,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:03,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:03,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309851999] [2025-01-09 06:01:03,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:03,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:03,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:03,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:03,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:03,548 INFO L87 Difference]: Start difference. First operand 2442 states and 3834 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:03,598 INFO L93 Difference]: Finished difference Result 4118 states and 6420 transitions. [2025-01-09 06:01:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:03,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 06:01:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:03,613 INFO L225 Difference]: With dead ends: 4118 [2025-01-09 06:01:03,614 INFO L226 Difference]: Without dead ends: 3248 [2025-01-09 06:01:03,617 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 06:01:03,617 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 1521 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:03,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1786 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2025-01-09 06:01:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3246. [2025-01-09 06:01:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3244 states have (on average 1.557953144266338) internal successors, (5054), 3245 states have internal predecessors, (5054), 0 states have call successors, (0), 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 06:01:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5054 transitions. [2025-01-09 06:01:03,722 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5054 transitions. Word has length 94 [2025-01-09 06:01:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:03,722 INFO L471 AbstractCegarLoop]: Abstraction has 3246 states and 5054 transitions. [2025-01-09 06:01:03,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5054 transitions. [2025-01-09 06:01:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:03,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:03,724 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] [2025-01-09 06:01:03,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:01:03,724 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:03,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1545704955, now seen corresponding path program 1 times [2025-01-09 06:01:03,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:03,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344193348] [2025-01-09 06:01:03,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:03,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:03,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:03,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:03,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:03,855 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 06:01:03,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:03,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344193348] [2025-01-09 06:01:03,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344193348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:03,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:03,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:03,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665095376] [2025-01-09 06:01:03,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:03,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:03,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:03,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:03,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:03,857 INFO L87 Difference]: Start difference. First operand 3246 states and 5054 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:03,929 INFO L93 Difference]: Finished difference Result 6466 states and 9968 transitions. [2025-01-09 06:01:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:03,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 06:01:03,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:03,951 INFO L225 Difference]: With dead ends: 6466 [2025-01-09 06:01:03,951 INFO L226 Difference]: Without dead ends: 4792 [2025-01-09 06:01:03,959 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 06:01:03,960 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 1517 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:03,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1782 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2025-01-09 06:01:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4790. [2025-01-09 06:01:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4790 states, 4788 states have (on average 1.5384294068504596) internal successors, (7366), 4789 states have internal predecessors, (7366), 0 states have call successors, (0), 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 06:01:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 7366 transitions. [2025-01-09 06:01:04,117 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 7366 transitions. Word has length 94 [2025-01-09 06:01:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:04,117 INFO L471 AbstractCegarLoop]: Abstraction has 4790 states and 7366 transitions. [2025-01-09 06:01:04,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 7366 transitions. [2025-01-09 06:01:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:04,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:04,119 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] [2025-01-09 06:01:04,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:01:04,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:04,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:04,120 INFO L85 PathProgramCache]: Analyzing trace with hash -968329477, now seen corresponding path program 1 times [2025-01-09 06:01:04,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:04,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427966203] [2025-01-09 06:01:04,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:04,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:04,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:04,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:04,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:04,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:04,213 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 06:01:04,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427966203] [2025-01-09 06:01:04,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427966203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:04,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:04,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:04,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399685745] [2025-01-09 06:01:04,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:04,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:04,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:04,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:04,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:04,215 INFO L87 Difference]: Start difference. First operand 4790 states and 7366 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:04,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:04,322 INFO L93 Difference]: Finished difference Result 10970 states and 16680 transitions. [2025-01-09 06:01:04,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:04,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 06:01:04,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:04,355 INFO L225 Difference]: With dead ends: 10970 [2025-01-09 06:01:04,356 INFO L226 Difference]: Without dead ends: 7752 [2025-01-09 06:01:04,364 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 06:01:04,365 INFO L435 NwaCegarLoop]: 1655 mSDtfsCounter, 1515 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:04,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7752 states. [2025-01-09 06:01:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7752 to 7750. [2025-01-09 06:01:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7750 states, 7748 states have (on average 1.5144553433144037) internal successors, (11734), 7749 states have internal predecessors, (11734), 0 states have call successors, (0), 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 06:01:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7750 states to 7750 states and 11734 transitions. [2025-01-09 06:01:04,616 INFO L78 Accepts]: Start accepts. Automaton has 7750 states and 11734 transitions. Word has length 94 [2025-01-09 06:01:04,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:04,616 INFO L471 AbstractCegarLoop]: Abstraction has 7750 states and 11734 transitions. [2025-01-09 06:01:04,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7750 states and 11734 transitions. [2025-01-09 06:01:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:04,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:04,618 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] [2025-01-09 06:01:04,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:01:04,618 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:04,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:04,619 INFO L85 PathProgramCache]: Analyzing trace with hash -533793541, now seen corresponding path program 1 times [2025-01-09 06:01:04,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:04,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826641963] [2025-01-09 06:01:04,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:04,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:04,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:04,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:04,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:04,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:04,711 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 06:01:04,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:04,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826641963] [2025-01-09 06:01:04,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826641963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:04,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:04,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:04,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91354164] [2025-01-09 06:01:04,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:04,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:04,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:04,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:04,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:04,714 INFO L87 Difference]: Start difference. First operand 7750 states and 11734 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:04,964 INFO L93 Difference]: Finished difference Result 19594 states and 29336 transitions. [2025-01-09 06:01:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:04,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 06:01:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:05,004 INFO L225 Difference]: With dead ends: 19594 [2025-01-09 06:01:05,005 INFO L226 Difference]: Without dead ends: 13416 [2025-01-09 06:01:05,015 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 06:01:05,015 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1519 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:05,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13416 states. [2025-01-09 06:01:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13416 to 13414. [2025-01-09 06:01:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13414 states, 13412 states have (on average 1.4880703847300925) internal successors, (19958), 13413 states have internal predecessors, (19958), 0 states have call successors, (0), 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 06:01:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13414 states to 13414 states and 19958 transitions. [2025-01-09 06:01:05,442 INFO L78 Accepts]: Start accepts. Automaton has 13414 states and 19958 transitions. Word has length 94 [2025-01-09 06:01:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:05,442 INFO L471 AbstractCegarLoop]: Abstraction has 13414 states and 19958 transitions. [2025-01-09 06:01:05,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 13414 states and 19958 transitions. [2025-01-09 06:01:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:05,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:05,444 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] [2025-01-09 06:01:05,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:01:05,445 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:05,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2096140795, now seen corresponding path program 1 times [2025-01-09 06:01:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:05,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900986904] [2025-01-09 06:01:05,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:05,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:05,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:05,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:05,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:05,538 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 06:01:05,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:05,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900986904] [2025-01-09 06:01:05,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900986904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:05,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:05,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:05,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080921112] [2025-01-09 06:01:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:05,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:05,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:05,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:05,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:05,540 INFO L87 Difference]: Start difference. First operand 13414 states and 19958 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:05,864 INFO L93 Difference]: Finished difference Result 36074 states and 53112 transitions. [2025-01-09 06:01:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:05,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 06:01:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:05,924 INFO L225 Difference]: With dead ends: 36074 [2025-01-09 06:01:05,925 INFO L226 Difference]: Without dead ends: 24232 [2025-01-09 06:01:05,949 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 06:01:05,950 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1525 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:05,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24232 states. [2025-01-09 06:01:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24232 to 24230. [2025-01-09 06:01:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24230 states, 24228 states have (on average 1.4603764239722634) internal successors, (35382), 24229 states have internal predecessors, (35382), 0 states have call successors, (0), 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 06:01:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24230 states to 24230 states and 35382 transitions. [2025-01-09 06:01:06,669 INFO L78 Accepts]: Start accepts. Automaton has 24230 states and 35382 transitions. Word has length 94 [2025-01-09 06:01:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:06,669 INFO L471 AbstractCegarLoop]: Abstraction has 24230 states and 35382 transitions. [2025-01-09 06:01:06,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:01:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 24230 states and 35382 transitions. [2025-01-09 06:01:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 06:01:06,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:06,670 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] [2025-01-09 06:01:06,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:01:06,673 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:06,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:06,673 INFO L85 PathProgramCache]: Analyzing trace with hash 228723286, now seen corresponding path program 1 times [2025-01-09 06:01:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:06,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669116566] [2025-01-09 06:01:06,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:06,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 06:01:06,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 06:01:06,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:06,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:06,762 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 06:01:06,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:06,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669116566] [2025-01-09 06:01:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669116566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:06,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:06,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221830179] [2025-01-09 06:01:06,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:06,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:06,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:06,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:06,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:06,764 INFO L87 Difference]: Start difference. First operand 24230 states and 35382 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 06:01:07,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:07,285 INFO L93 Difference]: Finished difference Result 47789 states and 69948 transitions. [2025-01-09 06:01:07,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:07,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 06:01:07,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:07,386 INFO L225 Difference]: With dead ends: 47789 [2025-01-09 06:01:07,386 INFO L226 Difference]: Without dead ends: 35242 [2025-01-09 06:01:07,417 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 06:01:07,418 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 1526 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:07,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35242 states. [2025-01-09 06:01:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35242 to 35240. [2025-01-09 06:01:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35240 states, 35238 states have (on average 1.45093365117203) internal successors, (51128), 35239 states have internal predecessors, (51128), 0 states have call successors, (0), 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 06:01:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35240 states to 35240 states and 51128 transitions. [2025-01-09 06:01:08,401 INFO L78 Accepts]: Start accepts. Automaton has 35240 states and 51128 transitions. Word has length 96 [2025-01-09 06:01:08,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:08,401 INFO L471 AbstractCegarLoop]: Abstraction has 35240 states and 51128 transitions. [2025-01-09 06:01:08,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 06:01:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 35240 states and 51128 transitions. [2025-01-09 06:01:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:01:08,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:08,411 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 06:01:08,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:01:08,412 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:08,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1358034073, now seen corresponding path program 1 times [2025-01-09 06:01:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242324315] [2025-01-09 06:01:08,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:08,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:01:08,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:01:08,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:08,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 06:01:08,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:08,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242324315] [2025-01-09 06:01:08,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242324315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:08,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:08,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:08,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915469955] [2025-01-09 06:01:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:08,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:08,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:08,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:08,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:08,709 INFO L87 Difference]: Start difference. First operand 35240 states and 51128 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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 06:01:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:12,656 INFO L93 Difference]: Finished difference Result 311354 states and 449729 transitions. [2025-01-09 06:01:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:01:12,657 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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 119 [2025-01-09 06:01:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:13,529 INFO L225 Difference]: With dead ends: 311354 [2025-01-09 06:01:13,529 INFO L226 Difference]: Without dead ends: 277688 [2025-01-09 06:01:13,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 06:01:13,661 INFO L435 NwaCegarLoop]: 1706 mSDtfsCounter, 11835 mSDsluCounter, 3125 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11835 SdHoareTripleChecker+Valid, 4831 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:13,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11835 Valid, 4831 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:01:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277688 states. [2025-01-09 06:01:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277688 to 68904. [2025-01-09 06:01:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68904 states, 68902 states have (on average 1.4423964471278048) internal successors, (99384), 68903 states have internal predecessors, (99384), 0 states have call successors, (0), 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 06:01:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68904 states to 68904 states and 99384 transitions. [2025-01-09 06:01:18,037 INFO L78 Accepts]: Start accepts. Automaton has 68904 states and 99384 transitions. Word has length 119 [2025-01-09 06:01:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:18,038 INFO L471 AbstractCegarLoop]: Abstraction has 68904 states and 99384 transitions. [2025-01-09 06:01:18,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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 06:01:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 68904 states and 99384 transitions. [2025-01-09 06:01:18,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:01:18,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:18,051 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 06:01:18,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:01:18,051 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:18,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:18,052 INFO L85 PathProgramCache]: Analyzing trace with hash -831949159, now seen corresponding path program 1 times [2025-01-09 06:01:18,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:18,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108192398] [2025-01-09 06:01:18,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:18,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:18,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:01:18,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:01:18,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:18,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 06:01:18,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:18,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108192398] [2025-01-09 06:01:18,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108192398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:18,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:18,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:18,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784841626] [2025-01-09 06:01:18,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:18,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:18,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:18,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:18,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:18,442 INFO L87 Difference]: Start difference. First operand 68904 states and 99384 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 06:01:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:24,108 INFO L93 Difference]: Finished difference Result 345018 states and 497985 transitions. [2025-01-09 06:01:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:01:24,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 119 [2025-01-09 06:01:24,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:24,864 INFO L225 Difference]: With dead ends: 345018 [2025-01-09 06:01:24,864 INFO L226 Difference]: Without dead ends: 311352 [2025-01-09 06:01:24,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 06:01:24,955 INFO L435 NwaCegarLoop]: 1703 mSDtfsCounter, 11883 mSDsluCounter, 3076 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11883 SdHoareTripleChecker+Valid, 4779 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:24,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11883 Valid, 4779 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:01:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311352 states. [2025-01-09 06:01:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311352 to 119464. [2025-01-09 06:01:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119464 states, 119462 states have (on average 1.4351676683799033) internal successors, (171448), 119463 states have internal predecessors, (171448), 0 states have call successors, (0), 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 06:01:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119464 states to 119464 states and 171448 transitions. [2025-01-09 06:01:29,937 INFO L78 Accepts]: Start accepts. Automaton has 119464 states and 171448 transitions. Word has length 119 [2025-01-09 06:01:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:29,937 INFO L471 AbstractCegarLoop]: Abstraction has 119464 states and 171448 transitions. [2025-01-09 06:01:29,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 06:01:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 119464 states and 171448 transitions. [2025-01-09 06:01:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:01:29,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:29,950 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 06:01:29,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:01:29,950 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:29,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash -568092775, now seen corresponding path program 1 times [2025-01-09 06:01:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:29,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038132503] [2025-01-09 06:01:29,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:29,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:01:29,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:01:29,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:29,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 06:01:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038132503] [2025-01-09 06:01:30,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038132503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:30,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:30,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077459360] [2025-01-09 06:01:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:30,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:30,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:30,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:30,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:30,305 INFO L87 Difference]: Start difference. First operand 119464 states and 171448 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 06:01:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:36,557 INFO L93 Difference]: Finished difference Result 378682 states and 546241 transitions. [2025-01-09 06:01:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:01:36,558 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 119 [2025-01-09 06:01:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:37,346 INFO L225 Difference]: With dead ends: 378682 [2025-01-09 06:01:37,346 INFO L226 Difference]: Without dead ends: 345016 [2025-01-09 06:01:37,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 06:01:37,409 INFO L435 NwaCegarLoop]: 1700 mSDtfsCounter, 12041 mSDsluCounter, 2977 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12041 SdHoareTripleChecker+Valid, 4677 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:37,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12041 Valid, 4677 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:01:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345016 states. [2025-01-09 06:01:42,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345016 to 153128. [2025-01-09 06:01:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153128 states, 153126 states have (on average 1.4347922625811422) internal successors, (219704), 153127 states have internal predecessors, (219704), 0 states have call successors, (0), 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 06:01:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153128 states to 153128 states and 219704 transitions. [2025-01-09 06:01:42,852 INFO L78 Accepts]: Start accepts. Automaton has 153128 states and 219704 transitions. Word has length 119 [2025-01-09 06:01:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:42,853 INFO L471 AbstractCegarLoop]: Abstraction has 153128 states and 219704 transitions. [2025-01-09 06:01:42,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 06:01:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 153128 states and 219704 transitions. [2025-01-09 06:01:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:01:42,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:42,861 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 06:01:42,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:01:42,861 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:42,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:42,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1545299559, now seen corresponding path program 1 times [2025-01-09 06:01:42,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:42,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070103565] [2025-01-09 06:01:42,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:42,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:42,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:01:42,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:01:42,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:42,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 06:01:43,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:43,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070103565] [2025-01-09 06:01:43,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070103565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:43,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:43,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:43,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992864164] [2025-01-09 06:01:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:43,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:43,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:43,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:43,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:43,346 INFO L87 Difference]: Start difference. First operand 153128 states and 219704 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)