./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 532121231e517c5ccd98a51763e37538cc4af219147e372fd62404dc9cc0f64d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:23:42,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:23:42,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:23:42,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:23:42,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:23:42,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:23:42,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:23:42,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:23:42,694 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:23:42,694 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:23:42,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:23:42,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:23:42,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:23:42,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:23:42,695 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:23:42,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:23:42,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:23:42,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:23:42,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:23:42,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:23:42,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:23:42,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:23:42,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:23:42,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:23:42,696 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:23:42,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:23:42,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:23:42,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:23:42,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:23:42,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:23:42,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:23:42,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:23:42,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:23:42,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:23:42,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:23:42,697 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:23:42,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:23:42,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:23:42,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:23:42,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:23:42,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:23:42,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:23:42,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:23:42,698 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/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 -> 532121231e517c5ccd98a51763e37538cc4af219147e372fd62404dc9cc0f64d [2025-03-16 19:23:42,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:23:42,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:23:42,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:23:42,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:23:42,950 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:23:42,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2025-03-16 19:23:44,107 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110a41d9f/a2d84c95b3ce4c29b63edd0e0e7f628a/FLAGb627a8d78 [2025-03-16 19:23:44,497 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:23:44,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2025-03-16 19:23:44,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110a41d9f/a2d84c95b3ce4c29b63edd0e0e7f628a/FLAGb627a8d78 [2025-03-16 19:23:44,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110a41d9f/a2d84c95b3ce4c29b63edd0e0e7f628a [2025-03-16 19:23:44,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:23:44,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:23:44,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:23:44,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:23:44,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:23:44,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:23:44" (1/1) ... [2025-03-16 19:23:44,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63dd9844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:44, skipping insertion in model container [2025-03-16 19:23:44,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:23:44" (1/1) ... [2025-03-16 19:23:44,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:23:44,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8426,8439] [2025-03-16 19:23:44,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12993,13006] [2025-03-16 19:23:45,020 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20763,20776] [2025-03-16 19:23:45,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27894,27907] [2025-03-16 19:23:45,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[49218,49231] [2025-03-16 19:23:45,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[80449,80462] [2025-03-16 19:23:45,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:23:45,260 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:23:45,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8426,8439] [2025-03-16 19:23:45,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12993,13006] [2025-03-16 19:23:45,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20763,20776] [2025-03-16 19:23:45,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27894,27907] [2025-03-16 19:23:45,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[49218,49231] [2025-03-16 19:23:45,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[80449,80462] [2025-03-16 19:23:45,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:23:45,488 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:23:45,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45 WrapperNode [2025-03-16 19:23:45,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:23:45,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:23:45,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:23:45,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:23:45,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,658 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6446 [2025-03-16 19:23:45,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:23:45,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:23:45,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:23:45,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:23:45,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,740 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-03-16 19:23:45,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,783 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:23:45,832 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:23:45,833 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:23:45,833 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:23:45,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (1/1) ... [2025-03-16 19:23:45,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:23:45,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:45,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:23:45,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:23:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:23:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:23:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:23:45,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:23:46,075 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:23:46,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:23:48,620 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5388: havoc main_~node1____CPAchecker_TMP_0~7#1; [2025-03-16 19:23:48,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5653: havoc main_~node1____CPAchecker_TMP_0~8#1; [2025-03-16 19:23:48,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9485: havoc main_~node3____CPAchecker_TMP_0~11#1; [2025-03-16 19:23:48,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8033: havoc main_~node1____CPAchecker_TMP_1~13#1; [2025-03-16 19:23:48,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9355: havoc main_~node1____CPAchecker_TMP_1~16#1;havoc main_~node1__m1~56#1;havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~61#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~55#1;havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~60#1; [2025-03-16 19:23:48,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9884: havoc main_~node1__m1~60#1;havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~65#1;havoc main_~node3____CPAchecker_TMP_1~11#1; [2025-03-16 19:23:48,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7770: havoc main_~node2__m2~37#1;havoc main_~node1____CPAchecker_TMP_0~13#1; [2025-03-16 19:23:48,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8696: havoc main_~node3____CPAchecker_TMP_0~10#1; [2025-03-16 19:23:48,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1298: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:23:48,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1695: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-16 19:23:48,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L507: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:23:48,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7510: havoc main_~node1____CPAchecker_TMP_1~11#1; [2025-03-16 19:23:48,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2228: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-16 19:23:48,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~9#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:23:48,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10690: havoc main_~node2____CPAchecker_TMP_1~9#1; [2025-03-16 19:23:48,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2366: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:23:48,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5011: havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-16 19:23:48,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8320: havoc main_~node1____CPAchecker_TMP_1~14#1;havoc main_~node1__m1~48#1;havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~53#1;havoc main_~node3__m3~34#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~47#1;havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2025-03-16 19:23:48,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1186: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-16 19:23:48,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:23:48,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7926: havoc main_~node2____CPAchecker_TMP_1~6#1;havoc main_~node2__m2~38#1; [2025-03-16 19:23:48,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5416: havoc main_~node1____CPAchecker_TMP_1~6#1; [2025-03-16 19:23:48,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8059: havoc main_~node2__m2~39#1; [2025-03-16 19:23:48,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5683: havoc main_~node1____CPAchecker_TMP_1~7#1; [2025-03-16 19:23:48,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:23:48,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6742: havoc main_~node3__m3~28#1; [2025-03-16 19:23:48,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1723: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-16 19:23:48,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L535: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6878: havoc main_~node1__m1~39#1;havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~44#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~38#1;havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10314: havoc main_~node1____CPAchecker_TMP_1~18#1;havoc main_~node1__m1~64#1;havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~69#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~63#1;havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~68#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2915: havoc main_~node3__m3~11#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L801: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4897: havoc main_~node3__m3~20#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8069: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4370: havoc main_~node3__m3~17#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9524: havoc main_~node1__m1~57#1;havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~62#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6752: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4506: havoc main_~node1__m1~26#1;havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~29#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~25#1;havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~28#1; [2025-03-16 19:23:48,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8999: havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-03-16 19:23:48,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8735: havoc main_~node1__m1~51#1;havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2025-03-16 19:23:48,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7150: havoc main_~node1__m1~41#1;havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~46#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~40#1;havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2025-03-16 19:23:48,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6888: havoc main_~node1____CPAchecker_TMP_0~10#1; [2025-03-16 19:23:48,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8606: havoc main_~node3__m3~35#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~50#1;havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1; [2025-03-16 19:23:48,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6228: havoc main_~node1__m1~35#1;havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~40#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~34#1;havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1; [2025-03-16 19:23:48,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8078: havoc main_~node3__m3~33#1; [2025-03-16 19:23:48,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2925: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:23:48,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3850: havoc main_~node1__m1~22#1;havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~25#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~21#1;havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~24#1; [2025-03-16 19:23:48,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4380: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-16 19:23:48,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10460: havoc main_~node1__m1~65#1;havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~70#1;havoc main_~node3____CPAchecker_TMP_1~12#1; [2025-03-16 19:23:48,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~node2__m2~0#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7818: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5046: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7160: havoc main_~node1____CPAchecker_TMP_0~11#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8088: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5712: havoc main_~node2__m2~27#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8487: havoc main_~node1__m1~49#1;havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~54#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L296: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10077: havoc main_~node3__m3~42#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6510: havoc main_~node3__m3~26#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~36#1;havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~41#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4132: havoc main_~node3__m3~15#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~23#1;havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~26#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3474: havoc main_~node2__m2~17#1; [2025-03-16 19:23:48,626 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5722: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: havoc main_~node3__m3~0#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9027: havoc main_~node2____CPAchecker_TMP_1~7#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10087: havoc main_~node3____CPAchecker_TMP_0~12#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6917: havoc main_~node1____CPAchecker_TMP_1~9#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3484: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7846: havoc main_~node2____CPAchecker_TMP_1~5#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L315: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5338: havoc main_~node1__m1~30#1;havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~34#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~29#1;havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~33#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5074: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5999: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~38#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~33#1;havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3621: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~23#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~20#1;havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~22#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8907: havoc main_~node1__m1~53#1;havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~58#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~52#1;havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~57#1; [2025-03-16 19:23:48,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7190: havoc main_~node1____CPAchecker_TMP_1~10#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4944: havoc main_~check__tmp~32#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9173: havoc main_~node1__m1~54#1;havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~59#1;havoc main_~node3____CPAchecker_TMP_1~10#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5871: havoc main_~node3__m3~23#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3493: havoc main_~node3__m3~12#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1645: havoc main_~node1__m1~8#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~7#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc main_~node2__m2~9#1;havoc main_~node1__m1~12#1;havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4817: havoc main_~node1__m1~28#1;havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~31#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~27#1;havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~30#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L457: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6668: havoc main_~node3__m3~27#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~37#1;havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4290: havoc main_~node3__m3~16#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~24#1;havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~27#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4556: havoc main_~node1____CPAchecker_TMP_0~5#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8127: havoc main_~node1__m1~46#1;havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5881: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2578: havoc main_~node2__m2~10#1;havoc main_~node1__m1~13#1;havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3503: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6278: havoc main_~node1____CPAchecker_TMP_0~9#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3900: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5751: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8923: havoc main_~node1____CPAchecker_TMP_1~15#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2714: havoc main_~node2__m2~11#1;havoc main_~node1__m1~14#1;havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~16#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9717: havoc main_~node1____CPAchecker_TMP_1~17#1;havoc main_~node1__m1~59#1;havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~64#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~58#1;havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~63#1; [2025-03-16 19:23:48,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7471: havoc main_~node1__m1~43#1;havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~48#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~35#1;havoc main_~node1__m1~42#1;havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~47#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-03-16 19:23:48,629 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2848: havoc main_~node2__m2~12#1;havoc main_~node1__m1~15#1;havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~17#1; [2025-03-16 19:23:48,629 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7737: havoc main_~node1__m1~45#1;havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~50#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~44#1;havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2025-03-16 19:23:48,629 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2189: havoc main_~node1__m1~11#1;havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~13#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~10#1;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-16 19:23:48,629 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1001: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:23:48,629 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: havoc main_~node2__m2~13#1;havoc main_~node1__m1~16#1;havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~18#1; [2025-03-16 19:23:48,629 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10651: havoc main_~node2__m2~49#1;havoc main_~node1____CPAchecker_TMP_1~19#1;havoc main_~node1__m1~67#1;havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~72#1;havoc main_~node3__m3~44#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~66#1;havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~71#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7481: havoc main_~node1____CPAchecker_TMP_0~12#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10126: havoc main_~node1__m1~62#1;havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~67#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2199: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7881: havoc main_~node1____CPAchecker_TMP_1~12#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3127: havoc main_~node2__m2~14#1;havoc main_~node1__m1~17#1;havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~19#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5109: havoc main_~node1____CPAchecker_TMP_1~5#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10661: havoc main_~node2____CPAchecker_TMP_0~7#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4584: havoc main_~node1____CPAchecker_TMP_1~4#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3263: havoc main_~node2__m2~15#1;havoc main_~node1__m1~18#1;havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~20#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10003: havoc main_~node3__m3~41#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~61#1;havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~66#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5643: havoc main_~node1__m1~32#1;havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~36#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~31#1;havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1; [2025-03-16 19:23:48,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9475: havoc main_~node3__m3~39#1;havoc main_~node2____CPAchecker_TMP_1~8#1; [2025-03-16 19:23:48,631 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3397: havoc main_~node2__m2~16#1;havoc main_~node1__m1~19#1;havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~21#1; [2025-03-16 19:23:48,631 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4983: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-16 19:23:48,631 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1416: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~6#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-16 19:23:48,631 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6306: havoc main_~node1____CPAchecker_TMP_1~8#1; [2025-03-16 19:23:48,631 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928: havoc main_~node1____CPAchecker_TMP_1~3#1; [2025-03-16 19:23:48,631 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4853: havoc main_~node2__m2~24#1;havoc main_~node1____CPAchecker_TMP_0~6#1; [2025-03-16 19:23:48,631 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8686: havoc main_~node3__m3~36#1; [2025-03-16 19:23:48,631 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8951: havoc main_~node2__m2~43#1; [2025-03-16 19:23:48,631 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1288: havoc main_~node3__m3~5#1; [2025-03-16 19:23:48,631 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7235: havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2__m2~34#1; [2025-03-16 19:23:48,874 INFO L? ?]: Removed 1251 outVars from TransFormulas that were not future-live. [2025-03-16 19:23:48,874 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:23:48,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:23:48,915 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:23:48,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:23:48 BoogieIcfgContainer [2025-03-16 19:23:48,916 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:23:48,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:23:48,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:23:48,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:23:48,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:23:44" (1/3) ... [2025-03-16 19:23:48,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5830dde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:23:48, skipping insertion in model container [2025-03-16 19:23:48,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:45" (2/3) ... [2025-03-16 19:23:48,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5830dde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:23:48, skipping insertion in model container [2025-03-16 19:23:48,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:23:48" (3/3) ... [2025-03-16 19:23:48,925 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2025-03-16 19:23:48,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:23:48,943 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c that has 1 procedures, 1289 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-16 19:23:49,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:23:49,031 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;@30ae100c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:23:49,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-16 19:23:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 1289 states, 1282 states have (on average 1.7722308892355694) internal successors, (2272), 1288 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:23:49,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:49,066 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] [2025-03-16 19:23:49,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:49,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:49,071 INFO L85 PathProgramCache]: Analyzing trace with hash -638314403, now seen corresponding path program 1 times [2025-03-16 19:23:49,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:49,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539008622] [2025-03-16 19:23:49,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:49,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:49,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:23:49,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:23:49,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:49,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:49,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:49,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539008622] [2025-03-16 19:23:49,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539008622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:49,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:49,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:23:49,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850965680] [2025-03-16 19:23:49,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:49,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:23:49,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:49,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:23:49,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:23:49,577 INFO L87 Difference]: Start difference. First operand has 1289 states, 1282 states have (on average 1.7722308892355694) internal successors, (2272), 1288 states have internal predecessors, (2272), 0 states have call successors, (0), 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 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:50,859 INFO L93 Difference]: Finished difference Result 2521 states and 4333 transitions. [2025-03-16 19:23:50,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:23:50,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 19:23:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:50,877 INFO L225 Difference]: With dead ends: 2521 [2025-03-16 19:23:50,878 INFO L226 Difference]: Without dead ends: 1597 [2025-03-16 19:23:50,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:23:50,887 INFO L435 NwaCegarLoop]: 1053 mSDtfsCounter, 7094 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7094 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:50,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7094 Valid, 1563 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:23:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2025-03-16 19:23:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1591. [2025-03-16 19:23:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1585 states have (on average 1.3078864353312303) internal successors, (2073), 1590 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2073 transitions. [2025-03-16 19:23:51,000 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2073 transitions. Word has length 51 [2025-03-16 19:23:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:51,000 INFO L471 AbstractCegarLoop]: Abstraction has 1591 states and 2073 transitions. [2025-03-16 19:23:51,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2073 transitions. [2025-03-16 19:23:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:23:51,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:51,007 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] [2025-03-16 19:23:51,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:23:51,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:51,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1262926177, now seen corresponding path program 1 times [2025-03-16 19:23:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:51,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070568524] [2025-03-16 19:23:51,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:51,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:51,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:23:51,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:23:51,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:51,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:51,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:51,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070568524] [2025-03-16 19:23:51,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070568524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:51,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:51,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:23:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453018239] [2025-03-16 19:23:51,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:51,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:23:51,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:51,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:23:51,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:23:51,220 INFO L87 Difference]: Start difference. First operand 1591 states and 2073 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:51,944 INFO L93 Difference]: Finished difference Result 3118 states and 4123 transitions. [2025-03-16 19:23:51,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:23:51,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-16 19:23:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:51,954 INFO L225 Difference]: With dead ends: 3118 [2025-03-16 19:23:51,954 INFO L226 Difference]: Without dead ends: 2033 [2025-03-16 19:23:51,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:23:51,956 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 4606 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:51,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 949 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:23:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2025-03-16 19:23:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2023. [2025-03-16 19:23:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2023 states, 2017 states have (on average 1.3197818542389688) internal successors, (2662), 2022 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2662 transitions. [2025-03-16 19:23:51,995 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2662 transitions. Word has length 52 [2025-03-16 19:23:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:51,995 INFO L471 AbstractCegarLoop]: Abstraction has 2023 states and 2662 transitions. [2025-03-16 19:23:51,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2662 transitions. [2025-03-16 19:23:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:23:51,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:51,998 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] [2025-03-16 19:23:51,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:23:51,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:52,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1252414183, now seen corresponding path program 1 times [2025-03-16 19:23:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:52,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879708633] [2025-03-16 19:23:52,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:52,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:52,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:23:52,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:23:52,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:52,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:52,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:52,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879708633] [2025-03-16 19:23:52,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879708633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:52,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:52,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:23:52,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012296010] [2025-03-16 19:23:52,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:52,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:23:52,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:52,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:23:52,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:23:52,154 INFO L87 Difference]: Start difference. First operand 2023 states and 2662 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:52,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:52,869 INFO L93 Difference]: Finished difference Result 4418 states and 5834 transitions. [2025-03-16 19:23:52,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:23:52,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-16 19:23:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:52,881 INFO L225 Difference]: With dead ends: 4418 [2025-03-16 19:23:52,881 INFO L226 Difference]: Without dead ends: 3081 [2025-03-16 19:23:52,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:23:52,884 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 4476 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:52,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4476 Valid, 973 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:23:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2025-03-16 19:23:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 3067. [2025-03-16 19:23:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 3061 states have (on average 1.3230970271153217) internal successors, (4050), 3066 states have internal predecessors, (4050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4050 transitions. [2025-03-16 19:23:52,957 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4050 transitions. Word has length 52 [2025-03-16 19:23:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:52,957 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4050 transitions. [2025-03-16 19:23:52,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4050 transitions. [2025-03-16 19:23:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:23:52,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:52,962 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] [2025-03-16 19:23:52,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:23:52,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:52,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1672347163, now seen corresponding path program 1 times [2025-03-16 19:23:52,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:52,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819157244] [2025-03-16 19:23:52,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:52,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:23:53,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:23:53,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:53,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:53,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819157244] [2025-03-16 19:23:53,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819157244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:53,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:53,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:23:53,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179520164] [2025-03-16 19:23:53,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:53,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:23:53,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:53,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:23:53,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:23:53,307 INFO L87 Difference]: Start difference. First operand 3067 states and 4050 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:54,385 INFO L93 Difference]: Finished difference Result 4444 states and 5990 transitions. [2025-03-16 19:23:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:23:54,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-16 19:23:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:54,395 INFO L225 Difference]: With dead ends: 4444 [2025-03-16 19:23:54,396 INFO L226 Difference]: Without dead ends: 3740 [2025-03-16 19:23:54,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:23:54,398 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 3404 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3404 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:54,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3404 Valid, 2878 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:23:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2025-03-16 19:23:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3067. [2025-03-16 19:23:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 3061 states have (on average 1.3227703364913428) internal successors, (4049), 3066 states have internal predecessors, (4049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4049 transitions. [2025-03-16 19:23:54,454 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4049 transitions. Word has length 54 [2025-03-16 19:23:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:54,455 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4049 transitions. [2025-03-16 19:23:54,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4049 transitions. [2025-03-16 19:23:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:23:54,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:54,457 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] [2025-03-16 19:23:54,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:23:54,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:54,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:54,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1776055964, now seen corresponding path program 1 times [2025-03-16 19:23:54,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:54,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111563607] [2025-03-16 19:23:54,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:54,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:54,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:23:54,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:23:54,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:54,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:54,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:54,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111563607] [2025-03-16 19:23:54,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111563607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:54,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:54,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:23:54,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917312499] [2025-03-16 19:23:54,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:54,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:23:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:54,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:23:54,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:23:54,762 INFO L87 Difference]: Start difference. First operand 3067 states and 4049 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:56,070 INFO L93 Difference]: Finished difference Result 5228 states and 7081 transitions. [2025-03-16 19:23:56,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:23:56,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-16 19:23:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:56,082 INFO L225 Difference]: With dead ends: 5228 [2025-03-16 19:23:56,082 INFO L226 Difference]: Without dead ends: 4658 [2025-03-16 19:23:56,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:23:56,086 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 3320 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 2798 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3320 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:56,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3320 Valid, 2938 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2798 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:23:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2025-03-16 19:23:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 3067. [2025-03-16 19:23:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 3061 states have (on average 1.3224436458673636) internal successors, (4048), 3066 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4048 transitions. [2025-03-16 19:23:56,165 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4048 transitions. Word has length 54 [2025-03-16 19:23:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:56,166 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4048 transitions. [2025-03-16 19:23:56,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4048 transitions. [2025-03-16 19:23:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:23:56,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:56,168 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] [2025-03-16 19:23:56,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:23:56,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:56,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 688973339, now seen corresponding path program 1 times [2025-03-16 19:23:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:56,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161819890] [2025-03-16 19:23:56,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:56,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:23:56,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:23:56,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:56,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:56,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:56,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161819890] [2025-03-16 19:23:56,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161819890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:56,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:56,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:23:56,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924404644] [2025-03-16 19:23:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:56,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:23:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:56,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:23:56,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:23:56,439 INFO L87 Difference]: Start difference. First operand 3067 states and 4048 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:57,499 INFO L93 Difference]: Finished difference Result 3834 states and 5054 transitions. [2025-03-16 19:23:57,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:23:57,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-16 19:23:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:57,508 INFO L225 Difference]: With dead ends: 3834 [2025-03-16 19:23:57,508 INFO L226 Difference]: Without dead ends: 3828 [2025-03-16 19:23:57,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:23:57,510 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 2407 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:57,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 3152 Invalid, 2725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2699 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:23:57,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2025-03-16 19:23:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3067. [2025-03-16 19:23:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 3061 states have (on average 1.3221169552433845) internal successors, (4047), 3066 states have internal predecessors, (4047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4047 transitions. [2025-03-16 19:23:57,573 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4047 transitions. Word has length 54 [2025-03-16 19:23:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:57,573 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4047 transitions. [2025-03-16 19:23:57,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4047 transitions. [2025-03-16 19:23:57,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:23:57,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:57,576 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] [2025-03-16 19:23:57,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:23:57,577 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:57,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash 101823906, now seen corresponding path program 1 times [2025-03-16 19:23:57,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:57,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121507896] [2025-03-16 19:23:57,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:57,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:57,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:23:57,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:23:57,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:57,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:57,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:57,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121507896] [2025-03-16 19:23:57,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121507896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:57,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:57,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134595005] [2025-03-16 19:23:57,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:57,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:57,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:57,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:57,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:57,674 INFO L87 Difference]: Start difference. First operand 3067 states and 4047 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:57,767 INFO L93 Difference]: Finished difference Result 5705 states and 7629 transitions. [2025-03-16 19:23:57,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:57,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-16 19:23:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:57,780 INFO L225 Difference]: With dead ends: 5705 [2025-03-16 19:23:57,780 INFO L226 Difference]: Without dead ends: 4074 [2025-03-16 19:23:57,784 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-03-16 19:23:57,785 INFO L435 NwaCegarLoop]: 1248 mSDtfsCounter, 667 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:57,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 2022 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4074 states. [2025-03-16 19:23:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4074 to 4068. [2025-03-16 19:23:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4068 states, 4062 states have (on average 1.2956671590349582) internal successors, (5263), 4067 states have internal predecessors, (5263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 5263 transitions. [2025-03-16 19:23:57,840 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 5263 transitions. Word has length 55 [2025-03-16 19:23:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:57,840 INFO L471 AbstractCegarLoop]: Abstraction has 4068 states and 5263 transitions. [2025-03-16 19:23:57,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 5263 transitions. [2025-03-16 19:23:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:23:57,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:57,843 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] [2025-03-16 19:23:57,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:23:57,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:57,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1909632699, now seen corresponding path program 1 times [2025-03-16 19:23:57,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:57,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746130734] [2025-03-16 19:23:57,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:57,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:23:57,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:23:57,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:57,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:57,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:57,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746130734] [2025-03-16 19:23:57,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746130734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:57,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:57,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:57,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821140782] [2025-03-16 19:23:57,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:57,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:57,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:57,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:57,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:57,933 INFO L87 Difference]: Start difference. First operand 4068 states and 5263 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:57,984 INFO L93 Difference]: Finished difference Result 5768 states and 7824 transitions. [2025-03-16 19:23:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:57,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-16 19:23:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:58,003 INFO L225 Difference]: With dead ends: 5768 [2025-03-16 19:23:58,003 INFO L226 Difference]: Without dead ends: 4355 [2025-03-16 19:23:58,009 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-03-16 19:23:58,009 INFO L435 NwaCegarLoop]: 1151 mSDtfsCounter, 563 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:58,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1739 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4355 states. [2025-03-16 19:23:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4355 to 4353. [2025-03-16 19:23:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4353 states, 4347 states have (on average 1.3250517598343685) internal successors, (5760), 4352 states have internal predecessors, (5760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 5760 transitions. [2025-03-16 19:23:58,088 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 5760 transitions. Word has length 55 [2025-03-16 19:23:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:58,088 INFO L471 AbstractCegarLoop]: Abstraction has 4353 states and 5760 transitions. [2025-03-16 19:23:58,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 5760 transitions. [2025-03-16 19:23:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:23:58,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:58,092 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] [2025-03-16 19:23:58,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:23:58,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:58,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash 401493346, now seen corresponding path program 1 times [2025-03-16 19:23:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:58,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984605376] [2025-03-16 19:23:58,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:58,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:58,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:23:58,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:23:58,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:58,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:58,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:58,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984605376] [2025-03-16 19:23:58,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984605376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:58,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:58,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:58,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147567268] [2025-03-16 19:23:58,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:58,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:58,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:58,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:58,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:58,152 INFO L87 Difference]: Start difference. First operand 4353 states and 5760 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:58,203 INFO L93 Difference]: Finished difference Result 7339 states and 10215 transitions. [2025-03-16 19:23:58,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:58,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-16 19:23:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:58,212 INFO L225 Difference]: With dead ends: 7339 [2025-03-16 19:23:58,212 INFO L226 Difference]: Without dead ends: 5309 [2025-03-16 19:23:58,215 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-03-16 19:23:58,218 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 570 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:58,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1703 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2025-03-16 19:23:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5307. [2025-03-16 19:23:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5307 states, 5301 states have (on average 1.3584229390681004) internal successors, (7201), 5306 states have internal predecessors, (7201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 7201 transitions. [2025-03-16 19:23:58,282 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 7201 transitions. Word has length 55 [2025-03-16 19:23:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:58,282 INFO L471 AbstractCegarLoop]: Abstraction has 5307 states and 7201 transitions. [2025-03-16 19:23:58,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 7201 transitions. [2025-03-16 19:23:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 19:23:58,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:58,285 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] [2025-03-16 19:23:58,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:23:58,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:58,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:58,286 INFO L85 PathProgramCache]: Analyzing trace with hash -521377333, now seen corresponding path program 1 times [2025-03-16 19:23:58,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:58,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589772624] [2025-03-16 19:23:58,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:58,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:58,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 19:23:58,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 19:23:58,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:58,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:58,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589772624] [2025-03-16 19:23:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589772624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:58,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:58,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:58,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737460385] [2025-03-16 19:23:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:58,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:58,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:58,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:58,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:58,341 INFO L87 Difference]: Start difference. First operand 5307 states and 7201 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:58,431 INFO L93 Difference]: Finished difference Result 9727 states and 13489 transitions. [2025-03-16 19:23:58,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:58,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-16 19:23:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:58,439 INFO L225 Difference]: With dead ends: 9727 [2025-03-16 19:23:58,439 INFO L226 Difference]: Without dead ends: 5596 [2025-03-16 19:23:58,443 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-03-16 19:23:58,444 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 811 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:58,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1243 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2025-03-16 19:23:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 4476. [2025-03-16 19:23:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4476 states, 4471 states have (on average 1.3741892194140013) internal successors, (6144), 4475 states have internal predecessors, (6144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 6144 transitions. [2025-03-16 19:23:58,510 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 6144 transitions. Word has length 56 [2025-03-16 19:23:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:58,510 INFO L471 AbstractCegarLoop]: Abstraction has 4476 states and 6144 transitions. [2025-03-16 19:23:58,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 6144 transitions. [2025-03-16 19:23:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 19:23:58,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:58,511 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] [2025-03-16 19:23:58,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:23:58,512 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:58,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:58,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1990349032, now seen corresponding path program 1 times [2025-03-16 19:23:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770091182] [2025-03-16 19:23:58,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:58,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 19:23:58,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 19:23:58,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:58,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:58,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:58,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770091182] [2025-03-16 19:23:58,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770091182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:58,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:58,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963877541] [2025-03-16 19:23:58,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:58,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:58,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:58,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:58,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:58,558 INFO L87 Difference]: Start difference. First operand 4476 states and 6144 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:58,621 INFO L93 Difference]: Finished difference Result 8536 states and 11967 transitions. [2025-03-16 19:23:58,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:58,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-16 19:23:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:58,630 INFO L225 Difference]: With dead ends: 8536 [2025-03-16 19:23:58,630 INFO L226 Difference]: Without dead ends: 4831 [2025-03-16 19:23:58,634 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-03-16 19:23:58,634 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 660 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:58,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 960 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2025-03-16 19:23:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 3909. [2025-03-16 19:23:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3909 states, 3905 states have (on average 1.392829705505762) internal successors, (5439), 3908 states have internal predecessors, (5439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 5439 transitions. [2025-03-16 19:23:58,677 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 5439 transitions. Word has length 56 [2025-03-16 19:23:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:58,678 INFO L471 AbstractCegarLoop]: Abstraction has 3909 states and 5439 transitions. [2025-03-16 19:23:58,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 5439 transitions. [2025-03-16 19:23:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 19:23:58,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:58,679 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] [2025-03-16 19:23:58,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:23:58,680 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:23:58,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash 4189765, now seen corresponding path program 1 times [2025-03-16 19:23:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:58,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621779208] [2025-03-16 19:23:58,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:58,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 19:23:58,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 19:23:58,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:58,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:59,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:59,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621779208] [2025-03-16 19:23:59,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621779208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:59,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:59,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 19:23:59,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134491853] [2025-03-16 19:23:59,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:59,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:23:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:59,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:23:59,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:23:59,776 INFO L87 Difference]: Start difference. First operand 3909 states and 5439 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:01,739 INFO L93 Difference]: Finished difference Result 6834 states and 9581 transitions. [2025-03-16 19:24:01,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:24:01,739 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-16 19:24:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:01,750 INFO L225 Difference]: With dead ends: 6834 [2025-03-16 19:24:01,750 INFO L226 Difference]: Without dead ends: 6735 [2025-03-16 19:24:01,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:24:01,753 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 4844 mSDsluCounter, 5610 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4844 SdHoareTripleChecker+Valid, 6212 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:01,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4844 Valid, 6212 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:24:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6735 states. [2025-03-16 19:24:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6735 to 3908. [2025-03-16 19:24:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3904 states have (on average 1.3926741803278688) internal successors, (5437), 3907 states have internal predecessors, (5437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5437 transitions. [2025-03-16 19:24:01,798 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5437 transitions. Word has length 56 [2025-03-16 19:24:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:01,798 INFO L471 AbstractCegarLoop]: Abstraction has 3908 states and 5437 transitions. [2025-03-16 19:24:01,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5437 transitions. [2025-03-16 19:24:01,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 19:24:01,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:01,799 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] [2025-03-16 19:24:01,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:24:01,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:01,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1077436852, now seen corresponding path program 1 times [2025-03-16 19:24:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:01,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693715052] [2025-03-16 19:24:01,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:01,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:01,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 19:24:01,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 19:24:01,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:01,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:01,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693715052] [2025-03-16 19:24:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693715052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:01,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70393069] [2025-03-16 19:24:01,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:01,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:01,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:01,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:01,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:01,849 INFO L87 Difference]: Start difference. First operand 3908 states and 5437 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:01,932 INFO L93 Difference]: Finished difference Result 7817 states and 11057 transitions. [2025-03-16 19:24:01,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:01,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-16 19:24:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:01,939 INFO L225 Difference]: With dead ends: 7817 [2025-03-16 19:24:01,939 INFO L226 Difference]: Without dead ends: 4250 [2025-03-16 19:24:01,944 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-03-16 19:24:01,944 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 466 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:01,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 840 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4250 states. [2025-03-16 19:24:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4250 to 3491. [2025-03-16 19:24:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 3487 states have (on average 1.4069400630914826) internal successors, (4906), 3490 states have internal predecessors, (4906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 4906 transitions. [2025-03-16 19:24:02,030 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 4906 transitions. Word has length 56 [2025-03-16 19:24:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:02,030 INFO L471 AbstractCegarLoop]: Abstraction has 3491 states and 4906 transitions. [2025-03-16 19:24:02,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4906 transitions. [2025-03-16 19:24:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 19:24:02,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:02,031 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] [2025-03-16 19:24:02,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:24:02,031 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:02,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:02,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1165508390, now seen corresponding path program 1 times [2025-03-16 19:24:02,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:02,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707919474] [2025-03-16 19:24:02,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:02,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:02,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 19:24:02,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 19:24:02,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:02,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:02,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:02,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707919474] [2025-03-16 19:24:02,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707919474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:02,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:02,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 19:24:02,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325735504] [2025-03-16 19:24:02,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:02,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:24:02,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:02,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:24:02,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:24:02,841 INFO L87 Difference]: Start difference. First operand 3491 states and 4906 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:04,556 INFO L93 Difference]: Finished difference Result 6719 states and 9488 transitions. [2025-03-16 19:24:04,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:24:04,557 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-16 19:24:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:04,568 INFO L225 Difference]: With dead ends: 6719 [2025-03-16 19:24:04,568 INFO L226 Difference]: Without dead ends: 6715 [2025-03-16 19:24:04,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 19:24:04,570 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 3554 mSDsluCounter, 6847 mSDsCounter, 0 mSdLazyCounter, 2841 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3554 SdHoareTripleChecker+Valid, 7390 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:04,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3554 Valid, 7390 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2841 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:24:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6715 states. [2025-03-16 19:24:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6715 to 3491. [2025-03-16 19:24:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 3487 states have (on average 1.4066532836248924) internal successors, (4905), 3490 states have internal predecessors, (4905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 4905 transitions. [2025-03-16 19:24:04,609 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 4905 transitions. Word has length 57 [2025-03-16 19:24:04,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:04,610 INFO L471 AbstractCegarLoop]: Abstraction has 3491 states and 4905 transitions. [2025-03-16 19:24:04,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:04,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4905 transitions. [2025-03-16 19:24:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 19:24:04,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:04,611 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] [2025-03-16 19:24:04,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:24:04,611 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:04,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1279356902, now seen corresponding path program 1 times [2025-03-16 19:24:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:04,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610754081] [2025-03-16 19:24:04,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:04,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 19:24:04,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 19:24:04,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:04,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:05,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:05,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610754081] [2025-03-16 19:24:05,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610754081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:05,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 19:24:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116081169] [2025-03-16 19:24:05,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:05,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:24:05,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:05,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:24:05,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:24:05,307 INFO L87 Difference]: Start difference. First operand 3491 states and 4905 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:06,818 INFO L93 Difference]: Finished difference Result 4889 states and 6860 transitions. [2025-03-16 19:24:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:24:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-16 19:24:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:06,825 INFO L225 Difference]: With dead ends: 4889 [2025-03-16 19:24:06,825 INFO L226 Difference]: Without dead ends: 4885 [2025-03-16 19:24:06,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:24:06,828 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 2727 mSDsluCounter, 6406 mSDsCounter, 0 mSdLazyCounter, 2537 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2727 SdHoareTripleChecker+Valid, 6961 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:06,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2727 Valid, 6961 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2537 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:24:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2025-03-16 19:24:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 3499. [2025-03-16 19:24:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 3495 states have (on average 1.4062947067238913) internal successors, (4915), 3498 states have internal predecessors, (4915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 4915 transitions. [2025-03-16 19:24:06,873 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 4915 transitions. Word has length 57 [2025-03-16 19:24:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:06,873 INFO L471 AbstractCegarLoop]: Abstraction has 3499 states and 4915 transitions. [2025-03-16 19:24:06,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 4915 transitions. [2025-03-16 19:24:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 19:24:06,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:06,875 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] [2025-03-16 19:24:06,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:24:06,875 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:06,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash 873916992, now seen corresponding path program 1 times [2025-03-16 19:24:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:06,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279149434] [2025-03-16 19:24:06,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:06,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:06,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 19:24:06,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 19:24:06,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:06,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:07,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:07,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279149434] [2025-03-16 19:24:07,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279149434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:07,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:07,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 19:24:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139331832] [2025-03-16 19:24:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:07,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:24:07,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:07,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:24:07,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:24:07,558 INFO L87 Difference]: Start difference. First operand 3499 states and 4915 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:09,032 INFO L93 Difference]: Finished difference Result 7025 states and 9955 transitions. [2025-03-16 19:24:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:24:09,032 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-16 19:24:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:09,039 INFO L225 Difference]: With dead ends: 7025 [2025-03-16 19:24:09,039 INFO L226 Difference]: Without dead ends: 7018 [2025-03-16 19:24:09,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:24:09,041 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 4409 mSDsluCounter, 5348 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4409 SdHoareTripleChecker+Valid, 5883 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:09,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4409 Valid, 5883 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:24:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7018 states. [2025-03-16 19:24:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7018 to 3499. [2025-03-16 19:24:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 3495 states have (on average 1.406008583690987) internal successors, (4914), 3498 states have internal predecessors, (4914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 4914 transitions. [2025-03-16 19:24:09,097 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 4914 transitions. Word has length 57 [2025-03-16 19:24:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:09,097 INFO L471 AbstractCegarLoop]: Abstraction has 3499 states and 4914 transitions. [2025-03-16 19:24:09,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 4914 transitions. [2025-03-16 19:24:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 19:24:09,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:09,098 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] [2025-03-16 19:24:09,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:24:09,099 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:09,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:09,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1765529154, now seen corresponding path program 1 times [2025-03-16 19:24:09,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:09,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279734199] [2025-03-16 19:24:09,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:09,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:09,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 19:24:09,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 19:24:09,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:09,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:09,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:09,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279734199] [2025-03-16 19:24:09,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279734199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:09,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:09,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:24:09,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246307556] [2025-03-16 19:24:09,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:09,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:24:09,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:09,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:24:09,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:24:09,361 INFO L87 Difference]: Start difference. First operand 3499 states and 4914 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:09,643 INFO L93 Difference]: Finished difference Result 5075 states and 7175 transitions. [2025-03-16 19:24:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:24:09,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-16 19:24:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:09,647 INFO L225 Difference]: With dead ends: 5075 [2025-03-16 19:24:09,647 INFO L226 Difference]: Without dead ends: 4918 [2025-03-16 19:24:09,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:24:09,648 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 1067 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:09,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 2033 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4918 states. [2025-03-16 19:24:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4918 to 3440. [2025-03-16 19:24:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3440 states, 3438 states have (on average 1.4089586969168122) internal successors, (4844), 3439 states have internal predecessors, (4844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4844 transitions. [2025-03-16 19:24:09,682 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4844 transitions. Word has length 58 [2025-03-16 19:24:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:09,682 INFO L471 AbstractCegarLoop]: Abstraction has 3440 states and 4844 transitions. [2025-03-16 19:24:09,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4844 transitions. [2025-03-16 19:24:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 19:24:09,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:09,683 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] [2025-03-16 19:24:09,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:24:09,684 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:09,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1543597570, now seen corresponding path program 1 times [2025-03-16 19:24:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:09,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068549373] [2025-03-16 19:24:09,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:09,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:09,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 19:24:09,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 19:24:09,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:09,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:10,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-03-16 19:24:10,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:10,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068549373] [2025-03-16 19:24:10,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068549373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:10,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:10,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:24:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019172444] [2025-03-16 19:24:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:10,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:24:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:10,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:24:10,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:24:10,109 INFO L87 Difference]: Start difference. First operand 3440 states and 4844 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:10,908 INFO L93 Difference]: Finished difference Result 5137 states and 7205 transitions. [2025-03-16 19:24:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:24:10,908 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-16 19:24:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:10,912 INFO L225 Difference]: With dead ends: 5137 [2025-03-16 19:24:10,912 INFO L226 Difference]: Without dead ends: 4985 [2025-03-16 19:24:10,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:24:10,913 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 2393 mSDsluCounter, 3867 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 4372 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:10,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 4372 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:24:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2025-03-16 19:24:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 3386. [2025-03-16 19:24:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.4100443131462335) internal successors, (4773), 3385 states have internal predecessors, (4773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4773 transitions. [2025-03-16 19:24:10,948 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4773 transitions. Word has length 58 [2025-03-16 19:24:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:10,948 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 4773 transitions. [2025-03-16 19:24:10,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4773 transitions. [2025-03-16 19:24:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:24:10,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:10,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:10,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:24:10,950 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:10,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1693734675, now seen corresponding path program 1 times [2025-03-16 19:24:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:10,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478483960] [2025-03-16 19:24:10,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:10,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:10,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:24:10,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:24:10,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:10,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:11,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478483960] [2025-03-16 19:24:11,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478483960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:11,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:11,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:11,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552051486] [2025-03-16 19:24:11,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:11,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:11,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:11,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:11,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:11,011 INFO L87 Difference]: Start difference. First operand 3386 states and 4773 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:11,082 INFO L93 Difference]: Finished difference Result 10506 states and 15169 transitions. [2025-03-16 19:24:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:11,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:24:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:11,089 INFO L225 Difference]: With dead ends: 10506 [2025-03-16 19:24:11,089 INFO L226 Difference]: Without dead ends: 7720 [2025-03-16 19:24:11,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:11,094 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1598 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:11,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 962 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7720 states. [2025-03-16 19:24:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7720 to 5862. [2025-03-16 19:24:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5862 states, 5861 states have (on average 1.410851390547688) internal successors, (8269), 5861 states have internal predecessors, (8269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5862 states to 5862 states and 8269 transitions. [2025-03-16 19:24:11,189 INFO L78 Accepts]: Start accepts. Automaton has 5862 states and 8269 transitions. Word has length 65 [2025-03-16 19:24:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:11,189 INFO L471 AbstractCegarLoop]: Abstraction has 5862 states and 8269 transitions. [2025-03-16 19:24:11,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5862 states and 8269 transitions. [2025-03-16 19:24:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:24:11,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:11,192 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] [2025-03-16 19:24:11,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:24:11,193 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1036477670, now seen corresponding path program 1 times [2025-03-16 19:24:11,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:11,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367036927] [2025-03-16 19:24:11,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:11,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:11,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:24:11,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:24:11,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:11,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:11,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:11,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367036927] [2025-03-16 19:24:11,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367036927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:11,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:11,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:11,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615850987] [2025-03-16 19:24:11,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:11,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:11,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:11,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:11,315 INFO L87 Difference]: Start difference. First operand 5862 states and 8269 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:11,386 INFO L93 Difference]: Finished difference Result 9960 states and 14146 transitions. [2025-03-16 19:24:11,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:11,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-16 19:24:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:11,395 INFO L225 Difference]: With dead ends: 9960 [2025-03-16 19:24:11,399 INFO L226 Difference]: Without dead ends: 4676 [2025-03-16 19:24:11,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:11,408 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 911 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:11,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 775 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2025-03-16 19:24:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 4672. [2025-03-16 19:24:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4672 states, 4671 states have (on average 1.3975594091201027) internal successors, (6528), 4671 states have internal predecessors, (6528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 6528 transitions. [2025-03-16 19:24:11,466 INFO L78 Accepts]: Start accepts. Automaton has 4672 states and 6528 transitions. Word has length 66 [2025-03-16 19:24:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:11,466 INFO L471 AbstractCegarLoop]: Abstraction has 4672 states and 6528 transitions. [2025-03-16 19:24:11,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4672 states and 6528 transitions. [2025-03-16 19:24:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:24:11,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:11,468 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] [2025-03-16 19:24:11,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:24:11,469 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:11,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1577862807, now seen corresponding path program 1 times [2025-03-16 19:24:11,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:11,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700201544] [2025-03-16 19:24:11,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:11,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:11,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:24:11,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:24:11,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:11,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700201544] [2025-03-16 19:24:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700201544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:11,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:11,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632004934] [2025-03-16 19:24:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:11,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:11,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:11,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:11,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:11,536 INFO L87 Difference]: Start difference. First operand 4672 states and 6528 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:11,617 INFO L93 Difference]: Finished difference Result 12480 states and 17662 transitions. [2025-03-16 19:24:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-16 19:24:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:11,626 INFO L225 Difference]: With dead ends: 12480 [2025-03-16 19:24:11,626 INFO L226 Difference]: Without dead ends: 8386 [2025-03-16 19:24:11,631 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-03-16 19:24:11,632 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 256 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:11,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 810 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8386 states. [2025-03-16 19:24:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8386 to 7872. [2025-03-16 19:24:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7872 states, 7871 states have (on average 1.3988057425994156) internal successors, (11010), 7871 states have internal predecessors, (11010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7872 states to 7872 states and 11010 transitions. [2025-03-16 19:24:11,718 INFO L78 Accepts]: Start accepts. Automaton has 7872 states and 11010 transitions. Word has length 68 [2025-03-16 19:24:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:11,718 INFO L471 AbstractCegarLoop]: Abstraction has 7872 states and 11010 transitions. [2025-03-16 19:24:11,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 7872 states and 11010 transitions. [2025-03-16 19:24:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:24:11,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:11,721 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] [2025-03-16 19:24:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:24:11,721 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:11,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash -70004321, now seen corresponding path program 1 times [2025-03-16 19:24:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:11,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106464318] [2025-03-16 19:24:11,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:11,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:24:11,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:24:11,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:11,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:11,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:11,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106464318] [2025-03-16 19:24:11,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106464318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:11,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:11,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:11,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228106085] [2025-03-16 19:24:11,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:11,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:11,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:11,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:11,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:11,801 INFO L87 Difference]: Start difference. First operand 7872 states and 11010 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:11,863 INFO L93 Difference]: Finished difference Result 21702 states and 30494 transitions. [2025-03-16 19:24:11,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:11,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-03-16 19:24:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:11,879 INFO L225 Difference]: With dead ends: 21702 [2025-03-16 19:24:11,879 INFO L226 Difference]: Without dead ends: 14392 [2025-03-16 19:24:11,887 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-03-16 19:24:11,888 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 291 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:11,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 779 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14392 states. [2025-03-16 19:24:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14392 to 13366. [2025-03-16 19:24:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13366 states, 13365 states have (on average 1.3887018331462775) internal successors, (18560), 13365 states have internal predecessors, (18560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13366 states to 13366 states and 18560 transitions. [2025-03-16 19:24:12,070 INFO L78 Accepts]: Start accepts. Automaton has 13366 states and 18560 transitions. Word has length 71 [2025-03-16 19:24:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:12,070 INFO L471 AbstractCegarLoop]: Abstraction has 13366 states and 18560 transitions. [2025-03-16 19:24:12,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 13366 states and 18560 transitions. [2025-03-16 19:24:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:24:12,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:12,072 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] [2025-03-16 19:24:12,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:24:12,072 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:12,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1023075041, now seen corresponding path program 1 times [2025-03-16 19:24:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:12,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767424278] [2025-03-16 19:24:12,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:12,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:12,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:24:12,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:24:12,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:12,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:12,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:12,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767424278] [2025-03-16 19:24:12,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767424278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:12,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:12,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:12,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511836973] [2025-03-16 19:24:12,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:12,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:24:12,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:12,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:24:12,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:24:12,256 INFO L87 Difference]: Start difference. First operand 13366 states and 18560 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:12,334 INFO L93 Difference]: Finished difference Result 14472 states and 20033 transitions. [2025-03-16 19:24:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:24:12,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-03-16 19:24:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:12,349 INFO L225 Difference]: With dead ends: 14472 [2025-03-16 19:24:12,349 INFO L226 Difference]: Without dead ends: 14470 [2025-03-16 19:24:12,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:24:12,355 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:12,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2367 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14470 states. [2025-03-16 19:24:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14470 to 14470. [2025-03-16 19:24:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14470 states, 14469 states have (on average 1.3590434722510194) internal successors, (19664), 14469 states have internal predecessors, (19664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14470 states to 14470 states and 19664 transitions. [2025-03-16 19:24:12,488 INFO L78 Accepts]: Start accepts. Automaton has 14470 states and 19664 transitions. Word has length 71 [2025-03-16 19:24:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:12,488 INFO L471 AbstractCegarLoop]: Abstraction has 14470 states and 19664 transitions. [2025-03-16 19:24:12,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 14470 states and 19664 transitions. [2025-03-16 19:24:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:24:12,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:12,490 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] [2025-03-16 19:24:12,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:24:12,490 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:12,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:12,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1839076184, now seen corresponding path program 1 times [2025-03-16 19:24:12,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:12,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70691481] [2025-03-16 19:24:12,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:12,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:24:12,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:24:12,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:12,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:12,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70691481] [2025-03-16 19:24:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70691481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:12,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:12,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99584360] [2025-03-16 19:24:12,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:12,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:12,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:12,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:12,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:12,598 INFO L87 Difference]: Start difference. First operand 14470 states and 19664 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:12,799 INFO L93 Difference]: Finished difference Result 39196 states and 53284 transitions. [2025-03-16 19:24:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:12,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-03-16 19:24:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:12,839 INFO L225 Difference]: With dead ends: 39196 [2025-03-16 19:24:12,839 INFO L226 Difference]: Without dead ends: 25290 [2025-03-16 19:24:12,874 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-03-16 19:24:12,874 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 283 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:12,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 741 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25290 states. [2025-03-16 19:24:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25290 to 25288. [2025-03-16 19:24:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25288 states, 25287 states have (on average 1.3398979712895955) internal successors, (33882), 25287 states have internal predecessors, (33882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25288 states to 25288 states and 33882 transitions. [2025-03-16 19:24:13,155 INFO L78 Accepts]: Start accepts. Automaton has 25288 states and 33882 transitions. Word has length 72 [2025-03-16 19:24:13,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:13,155 INFO L471 AbstractCegarLoop]: Abstraction has 25288 states and 33882 transitions. [2025-03-16 19:24:13,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 25288 states and 33882 transitions. [2025-03-16 19:24:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:24:13,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:13,157 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] [2025-03-16 19:24:13,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:24:13,158 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:13,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash -500185129, now seen corresponding path program 1 times [2025-03-16 19:24:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:13,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813984954] [2025-03-16 19:24:13,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:13,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:13,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:24:13,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:24:13,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:13,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813984954] [2025-03-16 19:24:13,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813984954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:13,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:13,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413960444] [2025-03-16 19:24:13,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:13,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:13,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:13,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:13,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:13,234 INFO L87 Difference]: Start difference. First operand 25288 states and 33882 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:13,490 INFO L93 Difference]: Finished difference Result 43340 states and 58266 transitions. [2025-03-16 19:24:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:13,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-16 19:24:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:13,531 INFO L225 Difference]: With dead ends: 43340 [2025-03-16 19:24:13,531 INFO L226 Difference]: Without dead ends: 35946 [2025-03-16 19:24:13,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:13,547 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1035 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:13,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1246 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:13,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35946 states. [2025-03-16 19:24:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35946 to 31300. [2025-03-16 19:24:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31300 states, 31299 states have (on average 1.335442026901818) internal successors, (41798), 31299 states have internal predecessors, (41798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31300 states to 31300 states and 41798 transitions. [2025-03-16 19:24:14,046 INFO L78 Accepts]: Start accepts. Automaton has 31300 states and 41798 transitions. Word has length 76 [2025-03-16 19:24:14,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:14,046 INFO L471 AbstractCegarLoop]: Abstraction has 31300 states and 41798 transitions. [2025-03-16 19:24:14,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 31300 states and 41798 transitions. [2025-03-16 19:24:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:24:14,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:14,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:14,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:24:14,049 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:14,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2117415930, now seen corresponding path program 1 times [2025-03-16 19:24:14,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:14,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091694911] [2025-03-16 19:24:14,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:14,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:14,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:24:14,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:24:14,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:14,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:14,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091694911] [2025-03-16 19:24:14,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091694911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:14,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:14,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836146617] [2025-03-16 19:24:14,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:14,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:14,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:14,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:14,188 INFO L87 Difference]: Start difference. First operand 31300 states and 41798 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:14,346 INFO L93 Difference]: Finished difference Result 49292 states and 66058 transitions. [2025-03-16 19:24:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:14,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:24:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:14,386 INFO L225 Difference]: With dead ends: 49292 [2025-03-16 19:24:14,386 INFO L226 Difference]: Without dead ends: 40202 [2025-03-16 19:24:14,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:14,399 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 983 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:14,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1239 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40202 states. [2025-03-16 19:24:14,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40202 to 37828. [2025-03-16 19:24:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37828 states, 37827 states have (on average 1.330848335844767) internal successors, (50342), 37827 states have internal predecessors, (50342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37828 states to 37828 states and 50342 transitions. [2025-03-16 19:24:14,879 INFO L78 Accepts]: Start accepts. Automaton has 37828 states and 50342 transitions. Word has length 77 [2025-03-16 19:24:14,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:14,879 INFO L471 AbstractCegarLoop]: Abstraction has 37828 states and 50342 transitions. [2025-03-16 19:24:14,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:14,879 INFO L276 IsEmpty]: Start isEmpty. Operand 37828 states and 50342 transitions. [2025-03-16 19:24:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:24:14,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:14,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:14,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:24:14,882 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:14,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:14,883 INFO L85 PathProgramCache]: Analyzing trace with hash 207706058, now seen corresponding path program 1 times [2025-03-16 19:24:14,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:14,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315561196] [2025-03-16 19:24:14,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:14,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:14,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:24:14,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:24:14,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:14,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:15,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:15,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315561196] [2025-03-16 19:24:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315561196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:15,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:15,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:15,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226846763] [2025-03-16 19:24:15,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:15,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:15,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:15,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:15,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:15,056 INFO L87 Difference]: Start difference. First operand 37828 states and 50342 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:15,192 INFO L93 Difference]: Finished difference Result 53604 states and 71650 transitions. [2025-03-16 19:24:15,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:15,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:24:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:15,238 INFO L225 Difference]: With dead ends: 53604 [2025-03-16 19:24:15,238 INFO L226 Difference]: Without dead ends: 46210 [2025-03-16 19:24:15,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:15,255 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 976 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:15,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1231 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46210 states. [2025-03-16 19:24:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46210 to 43836. [2025-03-16 19:24:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43836 states, 43835 states have (on average 1.3289380631915135) internal successors, (58254), 43835 states have internal predecessors, (58254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43836 states to 43836 states and 58254 transitions. [2025-03-16 19:24:15,792 INFO L78 Accepts]: Start accepts. Automaton has 43836 states and 58254 transitions. Word has length 77 [2025-03-16 19:24:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:15,792 INFO L471 AbstractCegarLoop]: Abstraction has 43836 states and 58254 transitions. [2025-03-16 19:24:15,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 43836 states and 58254 transitions. [2025-03-16 19:24:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:24:15,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:15,795 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] [2025-03-16 19:24:15,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:24:15,795 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:15,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash -10199740, now seen corresponding path program 1 times [2025-03-16 19:24:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:15,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405905617] [2025-03-16 19:24:15,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:15,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:24:15,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:24:15,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:15,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:15,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405905617] [2025-03-16 19:24:15,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405905617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:15,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:15,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:15,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807683746] [2025-03-16 19:24:15,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:15,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:15,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:15,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:15,880 INFO L87 Difference]: Start difference. First operand 43836 states and 58254 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:16,027 INFO L93 Difference]: Finished difference Result 59298 states and 78937 transitions. [2025-03-16 19:24:16,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:16,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-16 19:24:16,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:16,073 INFO L225 Difference]: With dead ends: 59298 [2025-03-16 19:24:16,073 INFO L226 Difference]: Without dead ends: 45896 [2025-03-16 19:24:16,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:16,092 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 1021 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:16,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 1245 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45896 states. [2025-03-16 19:24:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45896 to 43524. [2025-03-16 19:24:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43524 states, 43523 states have (on average 1.3265170139926017) internal successors, (57734), 43523 states have internal predecessors, (57734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43524 states to 43524 states and 57734 transitions. [2025-03-16 19:24:16,592 INFO L78 Accepts]: Start accepts. Automaton has 43524 states and 57734 transitions. Word has length 84 [2025-03-16 19:24:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:16,593 INFO L471 AbstractCegarLoop]: Abstraction has 43524 states and 57734 transitions. [2025-03-16 19:24:16,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 43524 states and 57734 transitions. [2025-03-16 19:24:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:24:16,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:16,596 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] [2025-03-16 19:24:16,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:24:16,596 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:16,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1115448754, now seen corresponding path program 1 times [2025-03-16 19:24:16,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:16,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181602945] [2025-03-16 19:24:16,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:16,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:16,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:24:16,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:24:16,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:16,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:16,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:16,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181602945] [2025-03-16 19:24:16,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181602945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:16,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:16,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:16,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601742358] [2025-03-16 19:24:16,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:16,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:24:16,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:16,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:24:16,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:16,926 INFO L87 Difference]: Start difference. First operand 43524 states and 57734 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:17,521 INFO L93 Difference]: Finished difference Result 53462 states and 70886 transitions. [2025-03-16 19:24:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:24:17,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-16 19:24:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:17,583 INFO L225 Difference]: With dead ends: 53462 [2025-03-16 19:24:17,584 INFO L226 Difference]: Without dead ends: 52318 [2025-03-16 19:24:17,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:24:17,602 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 2029 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:17,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 604 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:24:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52318 states. [2025-03-16 19:24:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52318 to 43517. [2025-03-16 19:24:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43517 states, 43516 states have (on average 1.3264776174280724) internal successors, (57723), 43516 states have internal predecessors, (57723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43517 states to 43517 states and 57723 transitions. [2025-03-16 19:24:18,137 INFO L78 Accepts]: Start accepts. Automaton has 43517 states and 57723 transitions. Word has length 85 [2025-03-16 19:24:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:18,137 INFO L471 AbstractCegarLoop]: Abstraction has 43517 states and 57723 transitions. [2025-03-16 19:24:18,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 43517 states and 57723 transitions. [2025-03-16 19:24:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:24:18,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:18,146 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:24:18,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:24:18,146 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:18,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash -738153128, now seen corresponding path program 1 times [2025-03-16 19:24:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977653850] [2025-03-16 19:24:18,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:18,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:24:18,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:24:18,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:18,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:24:18,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:18,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977653850] [2025-03-16 19:24:18,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977653850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:18,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:24:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130503908] [2025-03-16 19:24:18,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:18,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:24:18,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:18,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:24:18,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:24:18,368 INFO L87 Difference]: Start difference. First operand 43517 states and 57723 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:18,920 INFO L93 Difference]: Finished difference Result 77133 states and 101896 transitions. [2025-03-16 19:24:18,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:24:18,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-16 19:24:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:18,981 INFO L225 Difference]: With dead ends: 77133 [2025-03-16 19:24:18,981 INFO L226 Difference]: Without dead ends: 60889 [2025-03-16 19:24:19,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:24:19,007 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 1903 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1903 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:19,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1903 Valid, 1119 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:24:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60889 states. [2025-03-16 19:24:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60889 to 43499. [2025-03-16 19:24:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43499 states, 43498 states have (on average 1.32656673870063) internal successors, (57703), 43498 states have internal predecessors, (57703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43499 states to 43499 states and 57703 transitions. [2025-03-16 19:24:19,495 INFO L78 Accepts]: Start accepts. Automaton has 43499 states and 57703 transitions. Word has length 92 [2025-03-16 19:24:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:19,495 INFO L471 AbstractCegarLoop]: Abstraction has 43499 states and 57703 transitions. [2025-03-16 19:24:19,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 43499 states and 57703 transitions. [2025-03-16 19:24:19,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:24:19,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:19,503 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:24:19,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:24:19,503 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:19,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1735412919, now seen corresponding path program 1 times [2025-03-16 19:24:19,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:19,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419818968] [2025-03-16 19:24:19,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:19,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:24:19,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:24:19,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:19,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:24:19,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:19,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419818968] [2025-03-16 19:24:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419818968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:19,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:19,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358712106] [2025-03-16 19:24:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:19,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:24:19,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:19,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:24:19,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:19,705 INFO L87 Difference]: Start difference. First operand 43499 states and 57703 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:20,304 INFO L93 Difference]: Finished difference Result 82023 states and 108630 transitions. [2025-03-16 19:24:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:24:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-16 19:24:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:20,376 INFO L225 Difference]: With dead ends: 82023 [2025-03-16 19:24:20,376 INFO L226 Difference]: Without dead ends: 65873 [2025-03-16 19:24:20,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:24:20,405 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 1323 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:20,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 1148 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:24:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65873 states. [2025-03-16 19:24:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65873 to 43485. [2025-03-16 19:24:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43485 states, 43484 states have (on average 1.3266488823475302) internal successors, (57688), 43484 states have internal predecessors, (57688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43485 states to 43485 states and 57688 transitions. [2025-03-16 19:24:21,019 INFO L78 Accepts]: Start accepts. Automaton has 43485 states and 57688 transitions. Word has length 92 [2025-03-16 19:24:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:21,019 INFO L471 AbstractCegarLoop]: Abstraction has 43485 states and 57688 transitions. [2025-03-16 19:24:21,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 43485 states and 57688 transitions. [2025-03-16 19:24:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 19:24:21,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:21,028 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:24:21,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:24:21,028 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:21,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1048513902, now seen corresponding path program 1 times [2025-03-16 19:24:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:21,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305126750] [2025-03-16 19:24:21,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:21,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:21,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:24:21,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:24:21,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:21,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 19:24:21,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:21,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305126750] [2025-03-16 19:24:21,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305126750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:21,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:21,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:24:21,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722330891] [2025-03-16 19:24:21,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:21,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:24:21,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:21,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:24:21,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:24:21,233 INFO L87 Difference]: Start difference. First operand 43485 states and 57688 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:21,919 INFO L93 Difference]: Finished difference Result 96298 states and 126613 transitions. [2025-03-16 19:24:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:24:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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-03-16 19:24:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:21,996 INFO L225 Difference]: With dead ends: 96298 [2025-03-16 19:24:21,996 INFO L226 Difference]: Without dead ends: 63642 [2025-03-16 19:24:22,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:24:22,032 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 1897 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:22,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 1306 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:24:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63642 states. [2025-03-16 19:24:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63642 to 43471. [2025-03-16 19:24:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43471 states, 43470 states have (on average 1.326731078904992) internal successors, (57673), 43470 states have internal predecessors, (57673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43471 states to 43471 states and 57673 transitions. [2025-03-16 19:24:22,710 INFO L78 Accepts]: Start accepts. Automaton has 43471 states and 57673 transitions. Word has length 93 [2025-03-16 19:24:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:22,710 INFO L471 AbstractCegarLoop]: Abstraction has 43471 states and 57673 transitions. [2025-03-16 19:24:22,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 43471 states and 57673 transitions. [2025-03-16 19:24:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 19:24:22,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:22,719 INFO L218 NwaCegarLoop]: trace histogram [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-03-16 19:24:22,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:24:22,719 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:22,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash -743242854, now seen corresponding path program 1 times [2025-03-16 19:24:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382484103] [2025-03-16 19:24:22,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:22,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:24:22,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:24:22,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:22,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:23,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:23,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382484103] [2025-03-16 19:24:23,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382484103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:23,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588409369] [2025-03-16 19:24:23,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:23,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:23,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:23,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:23,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:24:23,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:24:23,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:24:23,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:23,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:23,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 19:24:23,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:24,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:24:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:24,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588409369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:24:24,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:24:24,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 28 [2025-03-16 19:24:24,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053246033] [2025-03-16 19:24:24,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:24:24,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 19:24:24,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:24,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 19:24:24,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-03-16 19:24:24,846 INFO L87 Difference]: Start difference. First operand 43471 states and 57673 transitions. Second operand has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 28 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:32,517 INFO L93 Difference]: Finished difference Result 337469 states and 439504 transitions. [2025-03-16 19:24:32,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2025-03-16 19:24:32,518 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 28 states have internal predecessors, (241), 0 states have call successors, (0), 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-03-16 19:24:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:32,890 INFO L225 Difference]: With dead ends: 337469 [2025-03-16 19:24:32,890 INFO L226 Difference]: Without dead ends: 321243 [2025-03-16 19:24:32,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6476 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3777, Invalid=15683, Unknown=0, NotChecked=0, Total=19460 [2025-03-16 19:24:32,935 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 5033 mSDsluCounter, 6462 mSDsCounter, 0 mSdLazyCounter, 7184 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5033 SdHoareTripleChecker+Valid, 6892 SdHoareTripleChecker+Invalid, 7313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 7184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:32,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5033 Valid, 6892 Invalid, 7313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 7184 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 19:24:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321243 states. [2025-03-16 19:24:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321243 to 44130. [2025-03-16 19:24:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44130 states, 44129 states have (on average 1.3262707063382355) internal successors, (58527), 44129 states have internal predecessors, (58527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44130 states to 44130 states and 58527 transitions. [2025-03-16 19:24:34,532 INFO L78 Accepts]: Start accepts. Automaton has 44130 states and 58527 transitions. Word has length 93 [2025-03-16 19:24:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:34,532 INFO L471 AbstractCegarLoop]: Abstraction has 44130 states and 58527 transitions. [2025-03-16 19:24:34,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 28 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 44130 states and 58527 transitions. [2025-03-16 19:24:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 19:24:34,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:34,540 INFO L218 NwaCegarLoop]: trace histogram [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-03-16 19:24:34,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:24:34,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-16 19:24:34,740 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:34,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1965177408, now seen corresponding path program 1 times [2025-03-16 19:24:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:34,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671196958] [2025-03-16 19:24:34,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:34,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:34,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:24:34,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:24:34,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:34,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:34,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671196958] [2025-03-16 19:24:34,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671196958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346189127] [2025-03-16 19:24:34,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:34,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:34,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:34,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:34,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:24:35,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:24:35,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:24:35,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:35,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:35,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 19:24:35,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:35,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:24:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346189127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:35,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:24:35,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2025-03-16 19:24:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894530661] [2025-03-16 19:24:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:35,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:24:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:35,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:24:35,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:24:35,459 INFO L87 Difference]: Start difference. First operand 44130 states and 58527 transitions. Second operand has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 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-03-16 19:24:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:36,919 INFO L93 Difference]: Finished difference Result 132222 states and 173985 transitions. [2025-03-16 19:24:36,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-16 19:24:36,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 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-03-16 19:24:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:37,042 INFO L225 Difference]: With dead ends: 132222 [2025-03-16 19:24:37,043 INFO L226 Difference]: Without dead ends: 116092 [2025-03-16 19:24:37,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 19:24:37,084 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 1596 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:37,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 3274 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2993 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:24:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116092 states. [2025-03-16 19:24:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116092 to 66378. [2025-03-16 19:24:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66378 states, 66377 states have (on average 1.3214065112915618) internal successors, (87711), 66377 states have internal predecessors, (87711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66378 states to 66378 states and 87711 transitions. [2025-03-16 19:24:38,539 INFO L78 Accepts]: Start accepts. Automaton has 66378 states and 87711 transitions. Word has length 93 [2025-03-16 19:24:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:38,540 INFO L471 AbstractCegarLoop]: Abstraction has 66378 states and 87711 transitions. [2025-03-16 19:24:38,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 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-03-16 19:24:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 66378 states and 87711 transitions. [2025-03-16 19:24:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:24:38,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:38,549 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:24:38,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 19:24:38,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-16 19:24:38,750 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:24:38,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:38,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1547730389, now seen corresponding path program 1 times [2025-03-16 19:24:38,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:38,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017392931] [2025-03-16 19:24:38,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:38,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:38,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:24:38,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:24:38,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:38,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017392931] [2025-03-16 19:24:39,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017392931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553763118] [2025-03-16 19:24:39,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:39,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:39,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:39,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:39,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:24:39,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:24:39,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:24:39,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:39,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:39,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 19:24:39,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:39,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:24:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:40,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553763118] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:24:40,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:24:40,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 12] total 26 [2025-03-16 19:24:40,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65936210] [2025-03-16 19:24:40,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:24:40,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 19:24:40,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:40,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 19:24:40,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:24:40,777 INFO L87 Difference]: Start difference. First operand 66378 states and 87711 transitions. Second operand has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:54,168 INFO L93 Difference]: Finished difference Result 796203 states and 1034320 transitions. [2025-03-16 19:24:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2025-03-16 19:24:54,169 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 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-03-16 19:24:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:55,501 INFO L225 Difference]: With dead ends: 796203 [2025-03-16 19:24:55,502 INFO L226 Difference]: Without dead ends: 731001 [2025-03-16 19:24:55,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29967 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8984, Invalid=61506, Unknown=0, NotChecked=0, Total=70490 [2025-03-16 19:24:55,591 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 10268 mSDsluCounter, 8567 mSDsCounter, 0 mSdLazyCounter, 9853 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10268 SdHoareTripleChecker+Valid, 9135 SdHoareTripleChecker+Invalid, 10060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 9853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:55,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10268 Valid, 9135 Invalid, 10060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 9853 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 19:24:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731001 states. [2025-03-16 19:25:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731001 to 84040. [2025-03-16 19:25:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84040 states, 84039 states have (on average 1.3174478515927128) internal successors, (110717), 84039 states have internal predecessors, (110717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84040 states to 84040 states and 110717 transitions. [2025-03-16 19:25:00,447 INFO L78 Accepts]: Start accepts. Automaton has 84040 states and 110717 transitions. Word has length 94 [2025-03-16 19:25:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:00,447 INFO L471 AbstractCegarLoop]: Abstraction has 84040 states and 110717 transitions. [2025-03-16 19:25:00,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 84040 states and 110717 transitions. [2025-03-16 19:25:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:25:00,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:00,460 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:00,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 19:25:00,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:00,661 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:00,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash -172371351, now seen corresponding path program 1 times [2025-03-16 19:25:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916932316] [2025-03-16 19:25:00,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:00,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:25:00,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:25:00,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:00,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:00,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:00,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916932316] [2025-03-16 19:25:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916932316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:00,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:00,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303857211] [2025-03-16 19:25:00,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:00,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:00,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:00,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:00,724 INFO L87 Difference]: Start difference. First operand 84040 states and 110717 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)