./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.ufo.UNBOUNDED.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 52ea16d32fee186339e754b295bffdbf40567dcb9eb1871e1f81ccc6c9f03c9b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:17:50,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:17:50,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:17:50,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:17:50,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:17:50,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:17:50,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:17:50,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:17:50,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:17:50,913 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:17:50,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:17:50,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:17:50,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:17:50,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:17:50,913 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:17:50,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:17:50,914 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:17:50,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:17:50,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:17:50,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:17:50,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:17:50,917 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:17:50,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:17:50,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:17:50,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:17:50,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:17:50,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:17:50,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:17:50,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:17:50,918 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 -> 52ea16d32fee186339e754b295bffdbf40567dcb9eb1871e1f81ccc6c9f03c9b [2025-03-08 06:17:51,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:17:51,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:17:51,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:17:51,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:17:51,152 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:17:51,154 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:17:52,290 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163128abd/5232b91c28084e169fbfd165960b4d57/FLAG72885fb96 [2025-03-08 06:17:52,640 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:17:52,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:17:52,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163128abd/5232b91c28084e169fbfd165960b4d57/FLAG72885fb96 [2025-03-08 06:17:52,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163128abd/5232b91c28084e169fbfd165960b4d57 [2025-03-08 06:17:52,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:17:52,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:17:52,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:17:52,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:17:52,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:17:52,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:17:52" (1/1) ... [2025-03-08 06:17:52,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610356d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:52, skipping insertion in model container [2025-03-08 06:17:52,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:17:52" (1/1) ... [2025-03-08 06:17:52,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:17:52,962 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[7184,7197] [2025-03-08 06:17:52,986 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11285,11298] [2025-03-08 06:17:53,019 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[18315,18328] [2025-03-08 06:17:53,043 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[24747,24760] [2025-03-08 06:17:53,083 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[43722,43735] [2025-03-08 06:17:53,131 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71504,71517] [2025-03-08 06:17:53,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:17:53,229 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:17:53,256 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[7184,7197] [2025-03-08 06:17:53,264 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11285,11298] [2025-03-08 06:17:53,283 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[18315,18328] [2025-03-08 06:17:53,290 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[24747,24760] [2025-03-08 06:17:53,313 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[43722,43735] [2025-03-08 06:17:53,345 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71504,71517] [2025-03-08 06:17:53,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:17:53,449 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:17:53,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53 WrapperNode [2025-03-08 06:17:53,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:17:53,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:17:53,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:17:53,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:17:53,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,605 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6039 [2025-03-08 06:17:53,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:17:53,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:17:53,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:17:53,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:17:53,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,664 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-08 06:17:53,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:17:53,754 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:17:53,754 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:17:53,754 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:17:53,755 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (1/1) ... [2025-03-08 06:17:53,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:17:53,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:17:53,778 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-08 06:17:53,781 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-08 06:17:53,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:17:53,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:17:53,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:17:53,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:17:53,975 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:17:53,977 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:17:56,330 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6576: havoc main_~node1__m1~39#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_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1; [2025-03-08 06:17:56,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4596: havoc main_~node1__m1~28#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_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~30#1; [2025-03-08 06:17:56,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6446: havoc main_~node3__m3~28#1; [2025-03-08 06:17:56,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5390: havoc main_~node1__m1~32#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_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1; [2025-03-08 06:17:56,332 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10018: havoc main_~node2__m2~50#1;havoc main_~node1____CPAchecker_TMP_1~18#1;havoc main_~node1__m1~64#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~49#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~68#1; [2025-03-08 06:17:56,332 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L241: havoc main_~node3__m3~0#1; [2025-03-08 06:17:56,332 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7376: havoc main_~node1__m1~45#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_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2025-03-08 06:17:56,332 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8434: havoc main_~node1__m1~51#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2025-03-08 06:17:56,333 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3943: havoc main_~node3__m3~15#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~23#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-08 06:17:56,333 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6586: havoc main_~node1____CPAchecker_TMP_0~10#1; [2025-03-08 06:17:56,333 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7512: havoc main_~node2__m2~38#1; [2025-03-08 06:17:56,334 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6456: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-08 06:17:56,334 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8042: havoc main_~node1____CPAchecker_TMP_1~14#1;havoc main_~node1__m1~48#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~41#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2025-03-08 06:17:56,334 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5400: havoc main_~node1____CPAchecker_TMP_0~8#1; [2025-03-08 06:17:56,334 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7386: havoc main_~node1____CPAchecker_TMP_0~13#1; [2025-03-08 06:17:56,334 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L251: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:17:56,334 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2233: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-08 06:17:56,334 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2762: havoc main_~node3__m3~11#1; [2025-03-08 06:17:56,334 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8314: havoc main_~node3__m3~35#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1; [2025-03-08 06:17:56,334 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2105: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-08 06:17:56,334 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7788: havoc main_~node2__m2~40#1; [2025-03-08 06:17:56,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: havoc main_~node1__m1~2#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_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:17:56,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4882: havoc main_~node1____CPAchecker_TMP_1~5#1; [2025-03-08 06:17:56,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4354: havoc main_~node1____CPAchecker_TMP_0~5#1; [2025-03-08 06:17:56,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7130: havoc main_~node1__m1~43#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_~__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-08 06:17:56,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4092: havoc main_~node3__m3~16#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~27#1; [2025-03-08 06:17:56,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6867: havoc main_~node1____CPAchecker_TMP_1~10#1; [2025-03-08 06:17:56,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7396: havoc main_~node2__m2~37#1; [2025-03-08 06:17:56,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2243: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-08 06:17:56,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L922: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~4#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-08 06:17:56,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-08 06:17:56,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3301: havoc main_~node2__m2~17#1; [2025-03-08 06:17:56,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4756: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-08 06:17:56,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9250: havoc main_~node1__m1~57#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~62#1; [2025-03-08 06:17:56,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5154: havoc main_~node1____CPAchecker_TMP_0~7#1; [2025-03-08 06:17:56,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7665: havoc main_~node2____CPAchecker_TMP_1~7#1;havoc main_~node2__m2~39#1; [2025-03-08 06:17:56,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1323: 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_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-08 06:17:56,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8194: havoc main_~node1__m1~49#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-08 06:17:56,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7798: havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-03-08 06:17:56,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5949: havoc main_~node1__m1~35#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_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1; [2025-03-08 06:17:56,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9781: havoc main_~node3__m3~42#1; [2025-03-08 06:17:56,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4629: havoc main_~node2__m2~24#1;havoc main_~node1____CPAchecker_TMP_0~6#1; [2025-03-08 06:17:56,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7140: havoc main_~node1____CPAchecker_TMP_0~12#1; [2025-03-08 06:17:56,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1195: havoc main_~node3__m3~5#1; [2025-03-08 06:17:56,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1857: 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_~__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-08 06:17:56,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6614: havoc main_~node1____CPAchecker_TMP_1~9#1; [2025-03-08 06:17:56,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3311: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10446: havoc main_~node2____CPAchecker_TMP_1~12#1;havoc main_~node2__m2~52#1;havoc main_~node1____CPAchecker_TMP_1~19#1;havoc main_~node1__m1~67#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~51#1;havoc main_~node1__m1~66#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~71#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1596: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7807: havoc main_~node3__m3~33#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5429: havoc main_~node1____CPAchecker_TMP_1~7#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3448: 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_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~22#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8601: havoc main_~node1__m1~53#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~43#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~57#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9791: havoc main_~node3____CPAchecker_TMP_0~12#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1205: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9001: havoc main_~node2__m2~46#1;havoc main_~node1____CPAchecker_TMP_1~16#1;havoc main_~node1__m1~56#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~45#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~60#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3320: havoc main_~node3__m3~12#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6228: havoc main_~node3__m3~26#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~36#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-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3721: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7817: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4382: havoc main_~node1____CPAchecker_TMP_1~4#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10065: havoc main_~node2____CPAchecker_TMP_0~9#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3330: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4784: havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-08 06:17:56,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7559: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8617: havoc main_~node1____CPAchecker_TMP_1~15#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5182: havoc main_~node1____CPAchecker_TMP_1~6#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7168: havoc main_~node1____CPAchecker_TMP_1~11#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6377: havoc main_~node3__m3~27#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1624: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5456: havoc main_~node2__m2~27#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6910: havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2__m2~34#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1099: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7443: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671: havoc main_~node3__m3~20#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9826: havoc main_~node1__m1~62#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~67#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5466: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3749: havoc main_~node1____CPAchecker_TMP_1~3#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10093: havoc main_~node2____CPAchecker_TMP_1~11#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5733: 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_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8644: havoc main_~node2__m2~44#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7587: havoc main_~node2____CPAchecker_TMP_1~6#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5605: havoc main_~node3__m3~23#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7852: havoc main_~node1__m1~46#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2700: havoc main_~node2__m2~12#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~17#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3229: havoc main_~node2__m2~16#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~21#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9440: havoc main_~node1____CPAchecker_TMP_1~17#1;havoc main_~node1__m1~59#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~47#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~63#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6006: havoc main_~node1____CPAchecker_TMP_0~9#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2307: havoc main_~node2__m2~9#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2836: havoc main_~node2__m2~13#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~18#1; [2025-03-08 06:17:56,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: havoc main_~node2__m2~10#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1; [2025-03-08 06:17:56,341 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2969: havoc main_~node2__m2~14#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~19#1; [2025-03-08 06:17:56,341 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4819: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:17:56,341 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2573: havoc main_~node2__m2~11#1;havoc main_~node1__m1~14#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-08 06:17:56,341 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3102: havoc main_~node2__m2~15#1;havoc main_~node1__m1~18#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-08 06:17:56,341 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9048: havoc main_~node2____CPAchecker_TMP_0~8#1; [2025-03-08 06:17:56,341 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8389: havoc main_~node3__m3~36#1; [2025-03-08 06:17:56,342 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L726: 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_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:17:56,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5615: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-08 06:17:56,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8654: havoc main_~node2____CPAchecker_TMP_0~7#1; [2025-03-08 06:17:56,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9712: havoc main_~node3__m3~41#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~66#1; [2025-03-08 06:17:56,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4297: havoc main_~node1__m1~26#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_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~28#1; [2025-03-08 06:17:56,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:17:56,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10244: havoc main_~node1__m1~65#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-08 06:17:56,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4167: havoc main_~node3__m3~17#1; [2025-03-08 06:17:56,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7471: havoc main_~node2____CPAchecker_TMP_1~5#1; [2025-03-08 06:17:56,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8399: havoc main_~node3____CPAchecker_TMP_0~10#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5097: havoc main_~node1__m1~30#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_~__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-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5494: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L474: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9592: havoc main_~node1__m1~60#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-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4177: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2067: havoc main_~node1__m1~11#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_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1539: havoc main_~node1__m1~8#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_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9205: havoc main_~node3__m3~39#1;havoc main_~node2____CPAchecker_TMP_1~10#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6034: havoc main_~node1____CPAchecker_TMP_1~8#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6828: havoc main_~node1__m1~41#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_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc main_~node2__m2~0#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4847: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7622: havoc main_~node1____CPAchecker_TMP_1~12#1; [2025-03-08 06:17:56,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9076: havoc main_~node2____CPAchecker_TMP_1~9#1; [2025-03-08 06:17:56,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc main_~check__tmp~32#1; [2025-03-08 06:17:56,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8682: havoc main_~node2____CPAchecker_TMP_1~8#1; [2025-03-08 06:17:56,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8815: havoc main_~node1__m1~54#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-08 06:17:56,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2077: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-08 06:17:56,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3664: havoc main_~node1__m1~22#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_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~24#1; [2025-03-08 06:17:56,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9215: havoc main_~node3____CPAchecker_TMP_0~11#1; [2025-03-08 06:17:56,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7762: havoc main_~node1____CPAchecker_TMP_1~13#1; [2025-03-08 06:17:56,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6838: havoc main_~node1____CPAchecker_TMP_0~11#1; [2025-03-08 06:17:56,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L232: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:17:56,519 INFO L? ?]: Removed 1041 outVars from TransFormulas that were not future-live. [2025-03-08 06:17:56,520 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:17:56,553 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:17:56,553 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:17:56,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:17:56 BoogieIcfgContainer [2025-03-08 06:17:56,554 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:17:56,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:17:56,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:17:56,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:17:56,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:17:52" (1/3) ... [2025-03-08 06:17:56,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b90c1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:17:56, skipping insertion in model container [2025-03-08 06:17:56,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:53" (2/3) ... [2025-03-08 06:17:56,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b90c1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:17:56, skipping insertion in model container [2025-03-08 06:17:56,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:17:56" (3/3) ... [2025-03-08 06:17:56,561 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:17:56,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:17:56,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 1254 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-08 06:17:56,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:17:56,647 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;@1fcb60ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:17:56,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-08 06:17:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 1254 states, 1247 states have (on average 1.8043303929430634) internal successors, (2250), 1253 states have internal predecessors, (2250), 0 states have call successors, (0), 0 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-08 06:17:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 06:17:56,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:56,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] [2025-03-08 06:17:56,679 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-08 06:17:56,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:56,683 INFO L85 PathProgramCache]: Analyzing trace with hash 247370793, now seen corresponding path program 1 times [2025-03-08 06:17:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:56,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470175569] [2025-03-08 06:17:56,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:56,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:56,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 06:17:56,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 06:17:56,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:56,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:57,087 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-08 06:17:57,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:57,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470175569] [2025-03-08 06:17:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470175569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:57,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:57,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:17:57,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043356280] [2025-03-08 06:17:57,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:57,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:17:57,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:57,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:17:57,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:57,112 INFO L87 Difference]: Start difference. First operand has 1254 states, 1247 states have (on average 1.8043303929430634) internal successors, (2250), 1253 states have internal predecessors, (2250), 0 states have call successors, (0), 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-08 06:17:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:58,382 INFO L93 Difference]: Finished difference Result 2467 states and 4323 transitions. [2025-03-08 06:17:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:17:58,384 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-08 06:17:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:58,395 INFO L225 Difference]: With dead ends: 2467 [2025-03-08 06:17:58,395 INFO L226 Difference]: Without dead ends: 1550 [2025-03-08 06:17:58,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:17:58,403 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 7057 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7057 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:58,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7057 Valid, 1491 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:17:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2025-03-08 06:17:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1544. [2025-03-08 06:17:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1538 states have (on average 1.3563068920676202) internal successors, (2086), 1543 states have internal predecessors, (2086), 0 states have call successors, (0), 0 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-08 06:17:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2086 transitions. [2025-03-08 06:17:58,497 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2086 transitions. Word has length 51 [2025-03-08 06:17:58,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:58,498 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2086 transitions. [2025-03-08 06:17:58,498 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-08 06:17:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2086 transitions. [2025-03-08 06:17:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 06:17:58,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:58,501 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-08 06:17:58,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:17:58,501 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-08 06:17:58,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash -956613290, now seen corresponding path program 1 times [2025-03-08 06:17:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:58,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286892468] [2025-03-08 06:17:58,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:58,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:58,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 06:17:58,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 06:17:58,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:58,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:58,676 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-08 06:17:58,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:58,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286892468] [2025-03-08 06:17:58,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286892468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:58,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:58,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:17:58,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132119129] [2025-03-08 06:17:58,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:58,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:17:58,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:58,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:17:58,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:58,679 INFO L87 Difference]: Start difference. First operand 1544 states and 2086 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-08 06:17:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:59,404 INFO L93 Difference]: Finished difference Result 3069 states and 4222 transitions. [2025-03-08 06:17:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:17:59,404 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-08 06:17:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:59,411 INFO L225 Difference]: With dead ends: 3069 [2025-03-08 06:17:59,411 INFO L226 Difference]: Without dead ends: 1981 [2025-03-08 06:17:59,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:17:59,413 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 4621 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4621 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:59,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4621 Valid, 902 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:17:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2025-03-08 06:17:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2025-03-08 06:17:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1971 states, 1965 states have (on average 1.3689567430025444) internal successors, (2690), 1970 states have internal predecessors, (2690), 0 states have call successors, (0), 0 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-08 06:17:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2690 transitions. [2025-03-08 06:17:59,452 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2690 transitions. Word has length 52 [2025-03-08 06:17:59,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:59,452 INFO L471 AbstractCegarLoop]: Abstraction has 1971 states and 2690 transitions. [2025-03-08 06:17:59,452 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-08 06:17:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2690 transitions. [2025-03-08 06:17:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 06:17:59,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:59,455 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-08 06:17:59,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:17:59,455 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-08 06:17:59,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1530715901, now seen corresponding path program 1 times [2025-03-08 06:17:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:59,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875606930] [2025-03-08 06:17:59,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:59,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:59,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 06:17:59,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 06:17:59,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:59,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:59,599 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-08 06:17:59,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:59,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875606930] [2025-03-08 06:17:59,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875606930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:59,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:59,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:17:59,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479220722] [2025-03-08 06:17:59,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:59,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:17:59,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:59,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:17:59,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:59,601 INFO L87 Difference]: Start difference. First operand 1971 states and 2690 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-08 06:18:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:00,301 INFO L93 Difference]: Finished difference Result 4374 states and 6011 transitions. [2025-03-08 06:18:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:18:00,301 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-08 06:18:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:00,310 INFO L225 Difference]: With dead ends: 4374 [2025-03-08 06:18:00,310 INFO L226 Difference]: Without dead ends: 3047 [2025-03-08 06:18:00,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:18:00,313 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 4567 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:00,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 968 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:18:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3047 states. [2025-03-08 06:18:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3047 to 3035. [2025-03-08 06:18:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3029 states have (on average 1.3766919775503466) internal successors, (4170), 3034 states have internal predecessors, (4170), 0 states have call successors, (0), 0 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-08 06:18:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4170 transitions. [2025-03-08 06:18:00,366 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4170 transitions. Word has length 52 [2025-03-08 06:18:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:00,366 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 4170 transitions. [2025-03-08 06:18:00,366 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-08 06:18:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4170 transitions. [2025-03-08 06:18:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:18:00,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:00,369 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] [2025-03-08 06:18:00,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:18:00,369 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-08 06:18:00,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 569393369, now seen corresponding path program 1 times [2025-03-08 06:18:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:00,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858417043] [2025-03-08 06:18:00,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:00,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:18:00,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:18:00,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:00,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:00,715 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-08 06:18:00,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:00,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858417043] [2025-03-08 06:18:00,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858417043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:00,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:00,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:18:00,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283853991] [2025-03-08 06:18:00,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:00,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:18:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:00,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:18:00,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:18:00,716 INFO L87 Difference]: Start difference. First operand 3035 states and 4170 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-08 06:18:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:01,860 INFO L93 Difference]: Finished difference Result 4347 states and 6073 transitions. [2025-03-08 06:18:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:18:01,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-08 06:18:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:01,870 INFO L225 Difference]: With dead ends: 4347 [2025-03-08 06:18:01,870 INFO L226 Difference]: Without dead ends: 3676 [2025-03-08 06:18:01,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:18:01,872 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 5165 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5165 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:01,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5165 Valid, 2859 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:18:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2025-03-08 06:18:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3035. [2025-03-08 06:18:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3029 states have (on average 1.3763618355893035) internal successors, (4169), 3034 states have internal predecessors, (4169), 0 states have call successors, (0), 0 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-08 06:18:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4169 transitions. [2025-03-08 06:18:01,918 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4169 transitions. Word has length 53 [2025-03-08 06:18:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:01,918 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 4169 transitions. [2025-03-08 06:18:01,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-08 06:18:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4169 transitions. [2025-03-08 06:18:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:18:01,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:01,920 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] [2025-03-08 06:18:01,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:18:01,921 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-08 06:18:01,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:01,921 INFO L85 PathProgramCache]: Analyzing trace with hash 734562753, now seen corresponding path program 1 times [2025-03-08 06:18:01,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:01,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644313723] [2025-03-08 06:18:01,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:01,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:01,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:18:01,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:18:01,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:01,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:02,182 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-08 06:18:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644313723] [2025-03-08 06:18:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644313723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:02,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:18:02,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331607872] [2025-03-08 06:18:02,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:02,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:18:02,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:02,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:18:02,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:18:02,184 INFO L87 Difference]: Start difference. First operand 3035 states and 4169 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-08 06:18:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:03,789 INFO L93 Difference]: Finished difference Result 5327 states and 7445 transitions. [2025-03-08 06:18:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:18:03,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-08 06:18:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:03,800 INFO L225 Difference]: With dead ends: 5327 [2025-03-08 06:18:03,800 INFO L226 Difference]: Without dead ends: 4770 [2025-03-08 06:18:03,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:18:03,802 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 5526 mSDsluCounter, 3088 mSDsCounter, 0 mSdLazyCounter, 4057 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5526 SdHoareTripleChecker+Valid, 3801 SdHoareTripleChecker+Invalid, 4112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:03,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5526 Valid, 3801 Invalid, 4112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4057 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:18:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2025-03-08 06:18:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3035. [2025-03-08 06:18:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3029 states have (on average 1.3760316936282602) internal successors, (4168), 3034 states have internal predecessors, (4168), 0 states have call successors, (0), 0 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-08 06:18:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4168 transitions. [2025-03-08 06:18:03,859 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4168 transitions. Word has length 53 [2025-03-08 06:18:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:03,860 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 4168 transitions. [2025-03-08 06:18:03,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-08 06:18:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4168 transitions. [2025-03-08 06:18:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:18:03,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:03,862 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] [2025-03-08 06:18:03,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:18:03,862 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-08 06:18:03,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2071824519, now seen corresponding path program 1 times [2025-03-08 06:18:03,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:03,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762905381] [2025-03-08 06:18:03,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:03,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:18:03,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:18:03,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:03,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:04,096 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-08 06:18:04,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:04,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762905381] [2025-03-08 06:18:04,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762905381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:04,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:04,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:18:04,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100442833] [2025-03-08 06:18:04,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:04,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:18:04,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:04,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:18:04,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:18:04,097 INFO L87 Difference]: Start difference. First operand 3035 states and 4168 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-08 06:18:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:05,131 INFO L93 Difference]: Finished difference Result 3783 states and 5165 transitions. [2025-03-08 06:18:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:18:05,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-08 06:18:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:05,140 INFO L225 Difference]: With dead ends: 3783 [2025-03-08 06:18:05,140 INFO L226 Difference]: Without dead ends: 3778 [2025-03-08 06:18:05,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:18:05,142 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 6182 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6182 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:05,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6182 Valid, 2679 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:18:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2025-03-08 06:18:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3035. [2025-03-08 06:18:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3029 states have (on average 1.3757015516672169) internal successors, (4167), 3034 states have internal predecessors, (4167), 0 states have call successors, (0), 0 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-08 06:18:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4167 transitions. [2025-03-08 06:18:05,211 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4167 transitions. Word has length 53 [2025-03-08 06:18:05,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:05,212 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 4167 transitions. [2025-03-08 06:18:05,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-08 06:18:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4167 transitions. [2025-03-08 06:18:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:18:05,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:05,215 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-08 06:18:05,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:18:05,215 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-08 06:18:05,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:05,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1126934533, now seen corresponding path program 1 times [2025-03-08 06:18:05,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:05,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169845293] [2025-03-08 06:18:05,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:05,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:05,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:18:05,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:18:05,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:05,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:05,273 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-08 06:18:05,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:05,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169845293] [2025-03-08 06:18:05,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169845293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:05,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:05,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:05,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717596665] [2025-03-08 06:18:05,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:05,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:05,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:05,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:05,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:05,275 INFO L87 Difference]: Start difference. First operand 3035 states and 4167 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-08 06:18:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:05,380 INFO L93 Difference]: Finished difference Result 5417 states and 7598 transitions. [2025-03-08 06:18:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:05,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-08 06:18:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:05,388 INFO L225 Difference]: With dead ends: 5417 [2025-03-08 06:18:05,388 INFO L226 Difference]: Without dead ends: 3780 [2025-03-08 06:18:05,390 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-08 06:18:05,390 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 659 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:05,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2047 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:18:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2025-03-08 06:18:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 3774. [2025-03-08 06:18:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3774 states, 3768 states have (on average 1.3699575371549895) internal successors, (5162), 3773 states have internal predecessors, (5162), 0 states have call successors, (0), 0 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-08 06:18:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 5162 transitions. [2025-03-08 06:18:05,430 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 5162 transitions. Word has length 54 [2025-03-08 06:18:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:05,430 INFO L471 AbstractCegarLoop]: Abstraction has 3774 states and 5162 transitions. [2025-03-08 06:18:05,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-08 06:18:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 5162 transitions. [2025-03-08 06:18:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:18:05,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:05,432 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-08 06:18:05,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:18:05,433 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-08 06:18:05,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:05,433 INFO L85 PathProgramCache]: Analyzing trace with hash -696283544, now seen corresponding path program 1 times [2025-03-08 06:18:05,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:05,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347541820] [2025-03-08 06:18:05,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:18:05,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:18:05,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:05,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:05,486 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-08 06:18:05,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:05,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347541820] [2025-03-08 06:18:05,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347541820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:05,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:05,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:05,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306885147] [2025-03-08 06:18:05,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:05,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:05,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:05,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:05,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:05,487 INFO L87 Difference]: Start difference. First operand 3774 states and 5162 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-08 06:18:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:05,538 INFO L93 Difference]: Finished difference Result 5474 states and 7755 transitions. [2025-03-08 06:18:05,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:05,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-08 06:18:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:05,549 INFO L225 Difference]: With dead ends: 5474 [2025-03-08 06:18:05,550 INFO L226 Difference]: Without dead ends: 4173 [2025-03-08 06:18:05,551 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-08 06:18:05,552 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 563 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:05,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1736 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2025-03-08 06:18:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4171. [2025-03-08 06:18:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 4165 states have (on average 1.3872749099639856) internal successors, (5778), 4170 states have internal predecessors, (5778), 0 states have call successors, (0), 0 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-08 06:18:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 5778 transitions. [2025-03-08 06:18:05,596 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 5778 transitions. Word has length 54 [2025-03-08 06:18:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:05,598 INFO L471 AbstractCegarLoop]: Abstraction has 4171 states and 5778 transitions. [2025-03-08 06:18:05,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-08 06:18:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5778 transitions. [2025-03-08 06:18:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:18:05,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:05,616 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-08 06:18:05,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:18:05,616 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-08 06:18:05,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash -43028613, now seen corresponding path program 1 times [2025-03-08 06:18:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:05,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83333178] [2025-03-08 06:18:05,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:05,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:05,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:18:05,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:18:05,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:05,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:05,669 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-08 06:18:05,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:05,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83333178] [2025-03-08 06:18:05,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83333178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:05,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:05,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:05,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523200752] [2025-03-08 06:18:05,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:05,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:05,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:05,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:05,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:05,671 INFO L87 Difference]: Start difference. First operand 4171 states and 5778 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-08 06:18:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:05,725 INFO L93 Difference]: Finished difference Result 7092 states and 10232 transitions. [2025-03-08 06:18:05,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:05,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-08 06:18:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:05,735 INFO L225 Difference]: With dead ends: 7092 [2025-03-08 06:18:05,735 INFO L226 Difference]: Without dead ends: 5149 [2025-03-08 06:18:05,738 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-08 06:18:05,739 INFO L435 NwaCegarLoop]: 1118 mSDtfsCounter, 560 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:05,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1694 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5149 states. [2025-03-08 06:18:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5149 to 5147. [2025-03-08 06:18:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5147 states, 5141 states have (on average 1.4133437074499124) internal successors, (7266), 5146 states have internal predecessors, (7266), 0 states have call successors, (0), 0 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-08 06:18:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 7266 transitions. [2025-03-08 06:18:05,795 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 7266 transitions. Word has length 54 [2025-03-08 06:18:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:05,796 INFO L471 AbstractCegarLoop]: Abstraction has 5147 states and 7266 transitions. [2025-03-08 06:18:05,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-08 06:18:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 7266 transitions. [2025-03-08 06:18:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 06:18:05,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:05,798 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-08 06:18:05,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:18:05,799 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:05,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:05,799 INFO L85 PathProgramCache]: Analyzing trace with hash 744258676, now seen corresponding path program 1 times [2025-03-08 06:18:05,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:05,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206050250] [2025-03-08 06:18:05,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:05,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:05,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 06:18:05,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 06:18:05,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:05,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:05,835 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-08 06:18:05,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206050250] [2025-03-08 06:18:05,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206050250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:05,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:05,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:05,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466842456] [2025-03-08 06:18:05,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:05,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:05,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:05,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:05,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:05,836 INFO L87 Difference]: Start difference. First operand 5147 states and 7266 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-08 06:18:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:05,973 INFO L93 Difference]: Finished difference Result 9731 states and 13906 transitions. [2025-03-08 06:18:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:05,974 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-08 06:18:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:05,981 INFO L225 Difference]: With dead ends: 9731 [2025-03-08 06:18:05,981 INFO L226 Difference]: Without dead ends: 5091 [2025-03-08 06:18:05,986 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-08 06:18:05,986 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 857 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:05,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1489 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:18:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2025-03-08 06:18:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 4008. [2025-03-08 06:18:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 4002 states have (on average 1.4225387306346826) internal successors, (5693), 4007 states have internal predecessors, (5693), 0 states have call successors, (0), 0 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-08 06:18:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 5693 transitions. [2025-03-08 06:18:06,033 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 5693 transitions. Word has length 55 [2025-03-08 06:18:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:06,033 INFO L471 AbstractCegarLoop]: Abstraction has 4008 states and 5693 transitions. [2025-03-08 06:18:06,033 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-08 06:18:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 5693 transitions. [2025-03-08 06:18:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 06:18:06,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:06,035 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-08 06:18:06,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:18:06,036 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:06,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash 337706900, now seen corresponding path program 1 times [2025-03-08 06:18:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:06,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193097311] [2025-03-08 06:18:06,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:06,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 06:18:06,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 06:18:06,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:06,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:06,097 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-08 06:18:06,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:06,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193097311] [2025-03-08 06:18:06,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193097311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:06,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:06,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:06,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219885002] [2025-03-08 06:18:06,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:06,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:06,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:06,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:06,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:06,098 INFO L87 Difference]: Start difference. First operand 4008 states and 5693 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-08 06:18:06,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:06,180 INFO L93 Difference]: Finished difference Result 7836 states and 11358 transitions. [2025-03-08 06:18:06,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:06,180 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-08 06:18:06,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:06,187 INFO L225 Difference]: With dead ends: 7836 [2025-03-08 06:18:06,187 INFO L226 Difference]: Without dead ends: 4442 [2025-03-08 06:18:06,191 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-08 06:18:06,191 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 720 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1053 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-08 06:18:06,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1053 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:18:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2025-03-08 06:18:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 3588. [2025-03-08 06:18:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3588 states, 3583 states have (on average 1.4359475300027909) internal successors, (5145), 3587 states have internal predecessors, (5145), 0 states have call successors, (0), 0 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-08 06:18:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5145 transitions. [2025-03-08 06:18:06,232 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5145 transitions. Word has length 55 [2025-03-08 06:18:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:06,232 INFO L471 AbstractCegarLoop]: Abstraction has 3588 states and 5145 transitions. [2025-03-08 06:18:06,232 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-08 06:18:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5145 transitions. [2025-03-08 06:18:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 06:18:06,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:06,235 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-08 06:18:06,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:18:06,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:06,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1648708167, now seen corresponding path program 1 times [2025-03-08 06:18:06,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:06,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356118979] [2025-03-08 06:18:06,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:06,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:06,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 06:18:06,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 06:18:06,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:06,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:06,273 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-08 06:18:06,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:06,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356118979] [2025-03-08 06:18:06,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356118979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:06,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:06,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435770357] [2025-03-08 06:18:06,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:06,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:06,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:06,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:06,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:06,275 INFO L87 Difference]: Start difference. First operand 3588 states and 5145 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-08 06:18:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:06,334 INFO L93 Difference]: Finished difference Result 7275 states and 10602 transitions. [2025-03-08 06:18:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:06,334 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-08 06:18:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:06,340 INFO L225 Difference]: With dead ends: 7275 [2025-03-08 06:18:06,340 INFO L226 Difference]: Without dead ends: 4098 [2025-03-08 06:18:06,343 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-08 06:18:06,344 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 577 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:06,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 817 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-03-08 06:18:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3304. [2025-03-08 06:18:06,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3304 states, 3300 states have (on average 1.4481818181818182) internal successors, (4779), 3303 states have internal predecessors, (4779), 0 states have call successors, (0), 0 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-08 06:18:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 4779 transitions. [2025-03-08 06:18:06,379 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 4779 transitions. Word has length 55 [2025-03-08 06:18:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:06,380 INFO L471 AbstractCegarLoop]: Abstraction has 3304 states and 4779 transitions. [2025-03-08 06:18:06,380 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-08 06:18:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 4779 transitions. [2025-03-08 06:18:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:18:06,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:06,381 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-08 06:18:06,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:18:06,382 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-08 06:18:06,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash -436326369, now seen corresponding path program 1 times [2025-03-08 06:18:06,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:06,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075255260] [2025-03-08 06:18:06,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:06,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:06,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:18:06,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:18:06,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:06,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:06,863 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-08 06:18:06,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:06,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075255260] [2025-03-08 06:18:06,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075255260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:06,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:06,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:18:06,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805528183] [2025-03-08 06:18:06,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:06,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:18:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:06,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:18:06,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:18:06,865 INFO L87 Difference]: Start difference. First operand 3304 states and 4779 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-08 06:18:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:07,846 INFO L93 Difference]: Finished difference Result 9189 states and 13456 transitions. [2025-03-08 06:18:07,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:18:07,846 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-08 06:18:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:07,861 INFO L225 Difference]: With dead ends: 9189 [2025-03-08 06:18:07,861 INFO L226 Difference]: Without dead ends: 9185 [2025-03-08 06:18:07,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:18:07,865 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 4156 mSDsluCounter, 4319 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4156 SdHoareTripleChecker+Valid, 4887 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:07,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4156 Valid, 4887 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:18:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9185 states. [2025-03-08 06:18:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9185 to 3300. [2025-03-08 06:18:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3297 states have (on average 1.4482863208977859) internal successors, (4775), 3299 states have internal predecessors, (4775), 0 states have call successors, (0), 0 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-08 06:18:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4775 transitions. [2025-03-08 06:18:07,918 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4775 transitions. Word has length 56 [2025-03-08 06:18:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:07,919 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 4775 transitions. [2025-03-08 06:18:07,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-08 06:18:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4775 transitions. [2025-03-08 06:18:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:18:07,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:07,920 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-08 06:18:07,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:18:07,920 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:07,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2051554250, now seen corresponding path program 1 times [2025-03-08 06:18:07,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:07,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293531029] [2025-03-08 06:18:07,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:07,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:07,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:18:07,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:18:07,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:07,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:08,479 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-08 06:18:08,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:08,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293531029] [2025-03-08 06:18:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293531029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:08,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:08,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:18:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703991595] [2025-03-08 06:18:08,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:08,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:18:08,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:08,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:18:08,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:18:08,481 INFO L87 Difference]: Start difference. First operand 3300 states and 4775 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-08 06:18:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:09,378 INFO L93 Difference]: Finished difference Result 9181 states and 13449 transitions. [2025-03-08 06:18:09,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 06:18:09,378 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-08 06:18:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:09,392 INFO L225 Difference]: With dead ends: 9181 [2025-03-08 06:18:09,392 INFO L226 Difference]: Without dead ends: 9177 [2025-03-08 06:18:09,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:18:09,396 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 4071 mSDsluCounter, 3684 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4071 SdHoareTripleChecker+Valid, 4240 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:09,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4071 Valid, 4240 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:18:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9177 states. [2025-03-08 06:18:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9177 to 3296. [2025-03-08 06:18:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 3294 states have (on average 1.4483910139647844) internal successors, (4771), 3295 states have internal predecessors, (4771), 0 states have call successors, (0), 0 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-08 06:18:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 4771 transitions. [2025-03-08 06:18:09,463 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 4771 transitions. Word has length 56 [2025-03-08 06:18:09,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:09,463 INFO L471 AbstractCegarLoop]: Abstraction has 3296 states and 4771 transitions. [2025-03-08 06:18:09,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-08 06:18:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 4771 transitions. [2025-03-08 06:18:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:18:09,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:09,464 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-08 06:18:09,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:18:09,465 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:09,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash 527339259, now seen corresponding path program 1 times [2025-03-08 06:18:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:09,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416729416] [2025-03-08 06:18:09,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:09,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:18:09,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:18:09,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:09,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:09,803 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-08 06:18:09,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:09,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416729416] [2025-03-08 06:18:09,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416729416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:09,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:09,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:18:09,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400271502] [2025-03-08 06:18:09,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:09,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:18:09,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:09,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:18:09,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:18:09,804 INFO L87 Difference]: Start difference. First operand 3296 states and 4771 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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-08 06:18:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:10,421 INFO L93 Difference]: Finished difference Result 6803 states and 9899 transitions. [2025-03-08 06:18:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:18:10,422 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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-08 06:18:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:10,433 INFO L225 Difference]: With dead ends: 6803 [2025-03-08 06:18:10,433 INFO L226 Difference]: Without dead ends: 6711 [2025-03-08 06:18:10,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:18:10,436 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 2841 mSDsluCounter, 2000 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:10,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2841 Valid, 2547 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:18:10,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6711 states. [2025-03-08 06:18:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6711 to 3253. [2025-03-08 06:18:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3253 states, 3252 states have (on average 1.4501845018450183) internal successors, (4716), 3252 states have internal predecessors, (4716), 0 states have call successors, (0), 0 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-08 06:18:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 4716 transitions. [2025-03-08 06:18:10,489 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 4716 transitions. Word has length 56 [2025-03-08 06:18:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:10,490 INFO L471 AbstractCegarLoop]: Abstraction has 3253 states and 4716 transitions. [2025-03-08 06:18:10,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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-08 06:18:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 4716 transitions. [2025-03-08 06:18:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:18:10,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:10,491 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] [2025-03-08 06:18:10,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:18:10,492 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:10,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash 812015939, now seen corresponding path program 1 times [2025-03-08 06:18:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938216] [2025-03-08 06:18:10,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:10,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:18:10,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:18:10,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:10,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:10,562 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-08 06:18:10,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:10,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938216] [2025-03-08 06:18:10,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:10,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:10,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:18:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986691478] [2025-03-08 06:18:10,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:10,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:18:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:10,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:18:10,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:18:10,565 INFO L87 Difference]: Start difference. First operand 3253 states and 4716 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-08 06:18:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:10,648 INFO L93 Difference]: Finished difference Result 10210 states and 15109 transitions. [2025-03-08 06:18:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:18:10,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-08 06:18:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:10,659 INFO L225 Difference]: With dead ends: 10210 [2025-03-08 06:18:10,659 INFO L226 Difference]: Without dead ends: 7488 [2025-03-08 06:18:10,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:18:10,664 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1619 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:10,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 1073 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:18:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7488 states. [2025-03-08 06:18:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7488 to 5672. [2025-03-08 06:18:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5672 states, 5671 states have (on average 1.447892787868101) internal successors, (8211), 5671 states have internal predecessors, (8211), 0 states have call successors, (0), 0 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-08 06:18:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5672 states to 5672 states and 8211 transitions. [2025-03-08 06:18:10,732 INFO L78 Accepts]: Start accepts. Automaton has 5672 states and 8211 transitions. Word has length 63 [2025-03-08 06:18:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:10,732 INFO L471 AbstractCegarLoop]: Abstraction has 5672 states and 8211 transitions. [2025-03-08 06:18:10,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-08 06:18:10,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5672 states and 8211 transitions. [2025-03-08 06:18:10,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:18:10,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:10,736 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] [2025-03-08 06:18:10,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:18:10,736 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:10,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:10,737 INFO L85 PathProgramCache]: Analyzing trace with hash -529650830, now seen corresponding path program 1 times [2025-03-08 06:18:10,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:10,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305782772] [2025-03-08 06:18:10,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:10,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:10,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:18:10,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:18:10,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:10,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:10,815 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-08 06:18:10,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305782772] [2025-03-08 06:18:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305782772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:10,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:18:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157868089] [2025-03-08 06:18:10,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:10,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:18:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:10,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:18:10,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:18:10,816 INFO L87 Difference]: Start difference. First operand 5672 states and 8211 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-08 06:18:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:10,893 INFO L93 Difference]: Finished difference Result 8904 states and 12930 transitions. [2025-03-08 06:18:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:18:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 06:18:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:10,901 INFO L225 Difference]: With dead ends: 8904 [2025-03-08 06:18:10,901 INFO L226 Difference]: Without dead ends: 3742 [2025-03-08 06:18:10,906 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-08 06:18:10,906 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 991 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:10,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 801 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:18:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2025-03-08 06:18:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3738. [2025-03-08 06:18:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 3737 states have (on average 1.421996253679422) internal successors, (5314), 3737 states have internal predecessors, (5314), 0 states have call successors, (0), 0 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-08 06:18:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 5314 transitions. [2025-03-08 06:18:10,987 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 5314 transitions. Word has length 64 [2025-03-08 06:18:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:10,988 INFO L471 AbstractCegarLoop]: Abstraction has 3738 states and 5314 transitions. [2025-03-08 06:18:10,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-08 06:18:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 5314 transitions. [2025-03-08 06:18:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:18:10,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:10,990 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-08 06:18:10,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:18:10,990 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:10,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:10,991 INFO L85 PathProgramCache]: Analyzing trace with hash 894073034, now seen corresponding path program 1 times [2025-03-08 06:18:10,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:10,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254493664] [2025-03-08 06:18:10,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:10,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:11,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:18:11,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:18:11,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:11,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:11,071 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-08 06:18:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254493664] [2025-03-08 06:18:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254493664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:11,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639072775] [2025-03-08 06:18:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:11,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:11,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:11,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:11,073 INFO L87 Difference]: Start difference. First operand 3738 states and 5314 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-08 06:18:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:11,128 INFO L93 Difference]: Finished difference Result 9880 states and 14240 transitions. [2025-03-08 06:18:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:11,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-08 06:18:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:11,140 INFO L225 Difference]: With dead ends: 9880 [2025-03-08 06:18:11,140 INFO L226 Difference]: Without dead ends: 6652 [2025-03-08 06:18:11,145 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-08 06:18:11,145 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 299 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:11,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 849 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2025-03-08 06:18:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 6234. [2025-03-08 06:18:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6234 states, 6233 states have (on average 1.428204716829777) internal successors, (8902), 6233 states have internal predecessors, (8902), 0 states have call successors, (0), 0 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-08 06:18:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 8902 transitions. [2025-03-08 06:18:11,206 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 8902 transitions. Word has length 66 [2025-03-08 06:18:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:11,206 INFO L471 AbstractCegarLoop]: Abstraction has 6234 states and 8902 transitions. [2025-03-08 06:18:11,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-08 06:18:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 8902 transitions. [2025-03-08 06:18:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:18:11,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:11,208 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] [2025-03-08 06:18:11,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:18:11,208 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-08 06:18:11,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2139934006, now seen corresponding path program 1 times [2025-03-08 06:18:11,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:11,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39967047] [2025-03-08 06:18:11,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:11,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:11,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:18:11,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:18:11,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:11,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:11,285 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-08 06:18:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39967047] [2025-03-08 06:18:11,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39967047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:11,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:11,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230505259] [2025-03-08 06:18:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:11,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:11,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:11,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:11,286 INFO L87 Difference]: Start difference. First operand 6234 states and 8902 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-08 06:18:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:11,350 INFO L93 Difference]: Finished difference Result 17054 states and 24496 transitions. [2025-03-08 06:18:11,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:11,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-08 06:18:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:11,367 INFO L225 Difference]: With dead ends: 17054 [2025-03-08 06:18:11,367 INFO L226 Difference]: Without dead ends: 11308 [2025-03-08 06:18:11,375 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-08 06:18:11,376 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 327 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:11,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 802 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11308 states. [2025-03-08 06:18:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11308 to 10474. [2025-03-08 06:18:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10474 states, 10473 states have (on average 1.4239472930392438) internal successors, (14913), 10473 states have internal predecessors, (14913), 0 states have call successors, (0), 0 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-08 06:18:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10474 states to 10474 states and 14913 transitions. [2025-03-08 06:18:11,560 INFO L78 Accepts]: Start accepts. Automaton has 10474 states and 14913 transitions. Word has length 67 [2025-03-08 06:18:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:11,560 INFO L471 AbstractCegarLoop]: Abstraction has 10474 states and 14913 transitions. [2025-03-08 06:18:11,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-08 06:18:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10474 states and 14913 transitions. [2025-03-08 06:18:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:18:11,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:11,562 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-08 06:18:11,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:18:11,563 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-08 06:18:11,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:11,563 INFO L85 PathProgramCache]: Analyzing trace with hash 942935603, now seen corresponding path program 1 times [2025-03-08 06:18:11,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:11,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700335559] [2025-03-08 06:18:11,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:11,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:11,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:18:11,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:18:11,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:11,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:11,739 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-08 06:18:11,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700335559] [2025-03-08 06:18:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700335559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:11,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:11,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:18:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400772636] [2025-03-08 06:18:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:11,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:18:11,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:11,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:18:11,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:18:11,741 INFO L87 Difference]: Start difference. First operand 10474 states and 14913 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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-08 06:18:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:12,430 INFO L93 Difference]: Finished difference Result 20889 states and 29393 transitions. [2025-03-08 06:18:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:18:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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-08 06:18:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:12,456 INFO L225 Difference]: With dead ends: 20889 [2025-03-08 06:18:12,457 INFO L226 Difference]: Without dead ends: 16450 [2025-03-08 06:18:12,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:18:12,468 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1413 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:12,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 1499 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:18:12,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16450 states. [2025-03-08 06:18:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16450 to 10454. [2025-03-08 06:18:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10454 states, 10453 states have (on average 1.4244714436047068) internal successors, (14890), 10453 states have internal predecessors, (14890), 0 states have call successors, (0), 0 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-08 06:18:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10454 states to 10454 states and 14890 transitions. [2025-03-08 06:18:12,643 INFO L78 Accepts]: Start accepts. Automaton has 10454 states and 14890 transitions. Word has length 68 [2025-03-08 06:18:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:12,643 INFO L471 AbstractCegarLoop]: Abstraction has 10454 states and 14890 transitions. [2025-03-08 06:18:12,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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-08 06:18:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 10454 states and 14890 transitions. [2025-03-08 06:18:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:18:12,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:12,645 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] [2025-03-08 06:18:12,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:18:12,645 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-08 06:18:12,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2110666631, now seen corresponding path program 1 times [2025-03-08 06:18:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:12,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561321949] [2025-03-08 06:18:12,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:12,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:18:12,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:18:12,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:12,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:12,813 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-08 06:18:12,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561321949] [2025-03-08 06:18:12,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561321949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:12,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:18:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146578475] [2025-03-08 06:18:12,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:12,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:18:12,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:12,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:18:12,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:18:12,815 INFO L87 Difference]: Start difference. First operand 10454 states and 14890 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-08 06:18:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:12,860 INFO L93 Difference]: Finished difference Result 11344 states and 16075 transitions. [2025-03-08 06:18:12,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:18:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-08 06:18:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:12,879 INFO L225 Difference]: With dead ends: 11344 [2025-03-08 06:18:12,879 INFO L226 Difference]: Without dead ends: 11342 [2025-03-08 06:18:12,884 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-08 06:18:12,885 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 0 mSDsluCounter, 2042 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:12,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2555 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11342 states. [2025-03-08 06:18:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11342 to 11342. [2025-03-08 06:18:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11342 states, 11341 states have (on average 1.3912353407988713) internal successors, (15778), 11341 states have internal predecessors, (15778), 0 states have call successors, (0), 0 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-08 06:18:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11342 states to 11342 states and 15778 transitions. [2025-03-08 06:18:13,013 INFO L78 Accepts]: Start accepts. Automaton has 11342 states and 15778 transitions. Word has length 69 [2025-03-08 06:18:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:13,013 INFO L471 AbstractCegarLoop]: Abstraction has 11342 states and 15778 transitions. [2025-03-08 06:18:13,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-08 06:18:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 11342 states and 15778 transitions. [2025-03-08 06:18:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:18:13,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:13,015 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] [2025-03-08 06:18:13,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:18:13,015 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-08 06:18:13,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash -820286596, now seen corresponding path program 1 times [2025-03-08 06:18:13,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:13,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629496780] [2025-03-08 06:18:13,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:13,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:13,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:18:13,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:18:13,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:13,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:13,082 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-08 06:18:13,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:13,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629496780] [2025-03-08 06:18:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629496780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:13,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:13,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558287340] [2025-03-08 06:18:13,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:13,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:13,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:13,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:13,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:13,084 INFO L87 Difference]: Start difference. First operand 11342 states and 15778 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-08 06:18:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:13,170 INFO L93 Difference]: Finished difference Result 30662 states and 42766 transitions. [2025-03-08 06:18:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:13,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-08 06:18:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:13,202 INFO L225 Difference]: With dead ends: 30662 [2025-03-08 06:18:13,202 INFO L226 Difference]: Without dead ends: 19776 [2025-03-08 06:18:13,219 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-08 06:18:13,220 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 304 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:13,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 744 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19776 states. [2025-03-08 06:18:13,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19776 to 19478. [2025-03-08 06:18:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19478 states, 19477 states have (on average 1.3665348873029728) internal successors, (26616), 19477 states have internal predecessors, (26616), 0 states have call successors, (0), 0 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-08 06:18:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19478 states to 19478 states and 26616 transitions. [2025-03-08 06:18:13,420 INFO L78 Accepts]: Start accepts. Automaton has 19478 states and 26616 transitions. Word has length 70 [2025-03-08 06:18:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:13,420 INFO L471 AbstractCegarLoop]: Abstraction has 19478 states and 26616 transitions. [2025-03-08 06:18:13,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-08 06:18:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 19478 states and 26616 transitions. [2025-03-08 06:18:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:18:13,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:13,422 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] [2025-03-08 06:18:13,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:18:13,422 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-08 06:18:13,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:13,423 INFO L85 PathProgramCache]: Analyzing trace with hash 468687705, now seen corresponding path program 1 times [2025-03-08 06:18:13,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:13,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329205732] [2025-03-08 06:18:13,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:13,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:13,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:18:13,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:18:13,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:13,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:13,499 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-08 06:18:13,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:13,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329205732] [2025-03-08 06:18:13,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329205732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:13,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:13,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:18:13,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736095130] [2025-03-08 06:18:13,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:13,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:18:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:13,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:18:13,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:18:13,500 INFO L87 Difference]: Start difference. First operand 19478 states and 26616 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-08 06:18:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:13,616 INFO L93 Difference]: Finished difference Result 34312 states and 47054 transitions. [2025-03-08 06:18:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:18:13,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-03-08 06:18:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:13,721 INFO L225 Difference]: With dead ends: 34312 [2025-03-08 06:18:13,721 INFO L226 Difference]: Without dead ends: 28058 [2025-03-08 06:18:13,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 06:18:13,728 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1073 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:13,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1274 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28058 states. [2025-03-08 06:18:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28058 to 24431. [2025-03-08 06:18:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24431 states, 24430 states have (on average 1.3616455178059763) internal successors, (33265), 24430 states have internal predecessors, (33265), 0 states have call successors, (0), 0 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-08 06:18:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24431 states to 24431 states and 33265 transitions. [2025-03-08 06:18:13,954 INFO L78 Accepts]: Start accepts. Automaton has 24431 states and 33265 transitions. Word has length 73 [2025-03-08 06:18:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:13,954 INFO L471 AbstractCegarLoop]: Abstraction has 24431 states and 33265 transitions. [2025-03-08 06:18:13,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-08 06:18:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 24431 states and 33265 transitions. [2025-03-08 06:18:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:18:13,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:13,956 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] [2025-03-08 06:18:13,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:18:13,956 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-08 06:18:13,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash -110200026, now seen corresponding path program 1 times [2025-03-08 06:18:13,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:13,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417167012] [2025-03-08 06:18:13,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:13,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:13,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:18:13,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:18:13,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:13,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:14,024 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-08 06:18:14,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:14,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417167012] [2025-03-08 06:18:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417167012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:14,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:14,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:18:14,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500820320] [2025-03-08 06:18:14,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:14,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:18:14,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:14,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:18:14,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:18:14,026 INFO L87 Difference]: Start difference. First operand 24431 states and 33265 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-08 06:18:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:14,227 INFO L93 Difference]: Finished difference Result 37695 states and 51441 transitions. [2025-03-08 06:18:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:18:14,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-08 06:18:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:14,266 INFO L225 Difference]: With dead ends: 37695 [2025-03-08 06:18:14,266 INFO L226 Difference]: Without dead ends: 31401 [2025-03-08 06:18:14,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 06:18:14,277 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 974 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:14,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1305 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31401 states. [2025-03-08 06:18:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31401 to 29407. [2025-03-08 06:18:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29407 states, 29406 states have (on average 1.3571720057131198) internal successors, (39909), 29406 states have internal predecessors, (39909), 0 states have call successors, (0), 0 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-08 06:18:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29407 states to 29407 states and 39909 transitions. [2025-03-08 06:18:14,654 INFO L78 Accepts]: Start accepts. Automaton has 29407 states and 39909 transitions. Word has length 74 [2025-03-08 06:18:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:14,654 INFO L471 AbstractCegarLoop]: Abstraction has 29407 states and 39909 transitions. [2025-03-08 06:18:14,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-08 06:18:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 29407 states and 39909 transitions. [2025-03-08 06:18:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:18:14,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:14,657 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] [2025-03-08 06:18:14,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:18:14,657 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-08 06:18:14,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash -818945244, now seen corresponding path program 1 times [2025-03-08 06:18:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662734195] [2025-03-08 06:18:14,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:14,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:18:14,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:18:14,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:14,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:14,746 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-08 06:18:14,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:14,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662734195] [2025-03-08 06:18:14,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662734195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:14,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:14,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:18:14,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833952125] [2025-03-08 06:18:14,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:14,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:18:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:14,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:18:14,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:18:14,748 INFO L87 Difference]: Start difference. First operand 29407 states and 39909 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-08 06:18:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:14,903 INFO L93 Difference]: Finished difference Result 42608 states and 58102 transitions. [2025-03-08 06:18:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:18:14,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-08 06:18:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:14,955 INFO L225 Difference]: With dead ends: 42608 [2025-03-08 06:18:14,955 INFO L226 Difference]: Without dead ends: 36354 [2025-03-08 06:18:14,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 06:18:14,970 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 1064 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:14,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 1257 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36354 states. [2025-03-08 06:18:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36354 to 34360. [2025-03-08 06:18:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34360 states, 34359 states have (on average 1.3550452574289125) internal successors, (46558), 34359 states have internal predecessors, (46558), 0 states have call successors, (0), 0 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-08 06:18:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34360 states to 34360 states and 46558 transitions. [2025-03-08 06:18:15,552 INFO L78 Accepts]: Start accepts. Automaton has 34360 states and 46558 transitions. Word has length 74 [2025-03-08 06:18:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:15,552 INFO L471 AbstractCegarLoop]: Abstraction has 34360 states and 46558 transitions. [2025-03-08 06:18:15,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-08 06:18:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 34360 states and 46558 transitions. [2025-03-08 06:18:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:18:15,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:15,556 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] [2025-03-08 06:18:15,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:18:15,556 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-08 06:18:15,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:15,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1570297016, now seen corresponding path program 1 times [2025-03-08 06:18:15,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:15,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049214261] [2025-03-08 06:18:15,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:15,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:18:15,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:18:15,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:15,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:15,660 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-08 06:18:15,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:15,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049214261] [2025-03-08 06:18:15,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049214261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:15,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:15,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:18:15,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541383659] [2025-03-08 06:18:15,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:15,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:18:15,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:15,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:18:15,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:18:15,662 INFO L87 Difference]: Start difference. First operand 34360 states and 46558 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-08 06:18:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:15,800 INFO L93 Difference]: Finished difference Result 47282 states and 64197 transitions. [2025-03-08 06:18:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:18:15,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 06:18:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:15,848 INFO L225 Difference]: With dead ends: 47282 [2025-03-08 06:18:15,848 INFO L226 Difference]: Without dead ends: 36076 [2025-03-08 06:18:15,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 06:18:15,867 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 1057 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:15,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 1269 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36076 states. [2025-03-08 06:18:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36076 to 34084. [2025-03-08 06:18:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34084 states, 34083 states have (on average 1.3525217850541325) internal successors, (46098), 34083 states have internal predecessors, (46098), 0 states have call successors, (0), 0 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-08 06:18:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34084 states to 34084 states and 46098 transitions. [2025-03-08 06:18:16,350 INFO L78 Accepts]: Start accepts. Automaton has 34084 states and 46098 transitions. Word has length 81 [2025-03-08 06:18:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:16,351 INFO L471 AbstractCegarLoop]: Abstraction has 34084 states and 46098 transitions. [2025-03-08 06:18:16,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-08 06:18:16,352 INFO L276 IsEmpty]: Start isEmpty. Operand 34084 states and 46098 transitions. [2025-03-08 06:18:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:18:16,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:16,355 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] [2025-03-08 06:18:16,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:18:16,355 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-08 06:18:16,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:16,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1561046459, now seen corresponding path program 1 times [2025-03-08 06:18:16,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:16,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699073699] [2025-03-08 06:18:16,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:16,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:16,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:18:16,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:18:16,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:16,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:16,462 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-08 06:18:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699073699] [2025-03-08 06:18:16,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699073699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:16,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:16,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:18:16,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515764715] [2025-03-08 06:18:16,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:16,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:18:16,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:16,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:18:16,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:18:16,464 INFO L87 Difference]: Start difference. First operand 34084 states and 46098 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-08 06:18:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:16,600 INFO L93 Difference]: Finished difference Result 47006 states and 63737 transitions. [2025-03-08 06:18:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:18:16,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 06:18:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:16,642 INFO L225 Difference]: With dead ends: 47006 [2025-03-08 06:18:16,642 INFO L226 Difference]: Without dead ends: 35800 [2025-03-08 06:18:16,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 06:18:16,661 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 1054 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:16,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 1260 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:16,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35800 states. [2025-03-08 06:18:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35800 to 33808. [2025-03-08 06:18:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33808 states, 33807 states have (on average 1.3499571094743692) internal successors, (45638), 33807 states have internal predecessors, (45638), 0 states have call successors, (0), 0 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-08 06:18:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33808 states to 33808 states and 45638 transitions. [2025-03-08 06:18:17,092 INFO L78 Accepts]: Start accepts. Automaton has 33808 states and 45638 transitions. Word has length 81 [2025-03-08 06:18:17,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:17,092 INFO L471 AbstractCegarLoop]: Abstraction has 33808 states and 45638 transitions. [2025-03-08 06:18:17,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-08 06:18:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 33808 states and 45638 transitions. [2025-03-08 06:18:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 06:18:17,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:17,096 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] [2025-03-08 06:18:17,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:18:17,096 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-08 06:18:17,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:17,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1005273969, now seen corresponding path program 1 times [2025-03-08 06:18:17,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:17,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337357859] [2025-03-08 06:18:17,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:17,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:17,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:18:17,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:18:17,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:17,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:17,176 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-08 06:18:17,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:17,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337357859] [2025-03-08 06:18:17,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337357859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:17,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:17,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:18:17,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775360203] [2025-03-08 06:18:17,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:17,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:18:17,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:17,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:18:17,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:18:17,177 INFO L87 Difference]: Start difference. First operand 33808 states and 45638 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-08 06:18:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:17,592 INFO L93 Difference]: Finished difference Result 41242 states and 55578 transitions. [2025-03-08 06:18:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:18:17,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-08 06:18:17,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:17,638 INFO L225 Difference]: With dead ends: 41242 [2025-03-08 06:18:17,638 INFO L226 Difference]: Without dead ends: 40694 [2025-03-08 06:18:17,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:18:17,653 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 2005 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:17,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 675 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:18:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40694 states. [2025-03-08 06:18:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40694 to 33807. [2025-03-08 06:18:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33807 states, 33806 states have (on average 1.3499083003017216) internal successors, (45635), 33806 states have internal predecessors, (45635), 0 states have call successors, (0), 0 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-08 06:18:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33807 states to 33807 states and 45635 transitions. [2025-03-08 06:18:18,210 INFO L78 Accepts]: Start accepts. Automaton has 33807 states and 45635 transitions. Word has length 82 [2025-03-08 06:18:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:18,211 INFO L471 AbstractCegarLoop]: Abstraction has 33807 states and 45635 transitions. [2025-03-08 06:18:18,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-08 06:18:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 33807 states and 45635 transitions. [2025-03-08 06:18:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 06:18:18,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:18,215 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] [2025-03-08 06:18:18,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:18:18,215 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-08 06:18:18,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2125216480, now seen corresponding path program 1 times [2025-03-08 06:18:18,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:18,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108705048] [2025-03-08 06:18:18,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:18,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:18:18,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:18:18,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:18,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:18,326 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-08 06:18:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:18,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108705048] [2025-03-08 06:18:18,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108705048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:18,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:18,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:18:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519546253] [2025-03-08 06:18:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:18,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:18:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:18,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:18:18,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:18:18,328 INFO L87 Difference]: Start difference. First operand 33807 states and 45635 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-08 06:18:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:18,853 INFO L93 Difference]: Finished difference Result 41241 states and 55575 transitions. [2025-03-08 06:18:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:18:18,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-08 06:18:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:18,896 INFO L225 Difference]: With dead ends: 41241 [2025-03-08 06:18:18,896 INFO L226 Difference]: Without dead ends: 40693 [2025-03-08 06:18:18,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:18:18,910 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 2009 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2009 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:18,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2009 Valid, 667 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:18:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40693 states. [2025-03-08 06:18:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40693 to 33806. [2025-03-08 06:18:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33806 states, 33805 states have (on average 1.3498594882413844) internal successors, (45632), 33805 states have internal predecessors, (45632), 0 states have call successors, (0), 0 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-08 06:18:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 45632 transitions. [2025-03-08 06:18:19,328 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 45632 transitions. Word has length 82 [2025-03-08 06:18:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:19,328 INFO L471 AbstractCegarLoop]: Abstraction has 33806 states and 45632 transitions. [2025-03-08 06:18:19,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-08 06:18:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 45632 transitions. [2025-03-08 06:18:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:18:19,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:19,336 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] [2025-03-08 06:18:19,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:18:19,337 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-08 06:18:19,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1167147553, now seen corresponding path program 1 times [2025-03-08 06:18:19,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:19,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160774857] [2025-03-08 06:18:19,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:19,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:19,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:18:19,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:18:19,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:19,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:19,597 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-08 06:18:19,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:19,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160774857] [2025-03-08 06:18:19,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160774857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:19,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:19,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:18:19,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639329336] [2025-03-08 06:18:19,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:19,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:18:19,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:19,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:18:19,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:18:19,598 INFO L87 Difference]: Start difference. First operand 33806 states and 45632 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 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-08 06:18:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:20,103 INFO L93 Difference]: Finished difference Result 69323 states and 93578 transitions. [2025-03-08 06:18:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:18:20,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 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 89 [2025-03-08 06:18:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:20,171 INFO L225 Difference]: With dead ends: 69323 [2025-03-08 06:18:20,172 INFO L226 Difference]: Without dead ends: 53991 [2025-03-08 06:18:20,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:18:20,197 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 2147 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:20,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 1141 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:18:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53991 states. [2025-03-08 06:18:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53991 to 33794. [2025-03-08 06:18:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33794 states, 33793 states have (on average 1.3499541325126505) internal successors, (45619), 33793 states have internal predecessors, (45619), 0 states have call successors, (0), 0 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-08 06:18:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33794 states to 33794 states and 45619 transitions. [2025-03-08 06:18:20,710 INFO L78 Accepts]: Start accepts. Automaton has 33794 states and 45619 transitions. Word has length 89 [2025-03-08 06:18:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:20,711 INFO L471 AbstractCegarLoop]: Abstraction has 33794 states and 45619 transitions. [2025-03-08 06:18:20,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 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-08 06:18:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 33794 states and 45619 transitions. [2025-03-08 06:18:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:18:20,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:20,718 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] [2025-03-08 06:18:20,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:18:20,718 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-08 06:18:20,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash -371195846, now seen corresponding path program 1 times [2025-03-08 06:18:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:20,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702271463] [2025-03-08 06:18:20,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:20,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:18:20,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:18:20,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:20,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:20,949 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-08 06:18:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702271463] [2025-03-08 06:18:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702271463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:18:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619311611] [2025-03-08 06:18:20,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:20,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:18:20,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:18:20,953 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-08 06:18:20,954 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-08 06:18:21,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:18:21,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:18:21,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:21,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:21,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 06:18:21,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:18:21,480 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-08 06:18:21,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:18:22,119 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-08 06:18:22,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619311611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:18:22,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:18:22,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 26 [2025-03-08 06:18:22,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750960619] [2025-03-08 06:18:22,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:18:22,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 06:18:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:22,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 06:18:22,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:18:22,121 INFO L87 Difference]: Start difference. First operand 33794 states and 45619 transitions. Second operand has 26 states, 26 states have (on average 9.846153846153847) internal successors, (256), 26 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-08 06:18:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:29,874 INFO L93 Difference]: Finished difference Result 366605 states and 495850 transitions. [2025-03-08 06:18:29,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2025-03-08 06:18:29,874 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.846153846153847) internal successors, (256), 26 states have internal predecessors, (256), 0 states have call successors, (0), 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 89 [2025-03-08 06:18:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:30,441 INFO L225 Difference]: With dead ends: 366605 [2025-03-08 06:18:30,441 INFO L226 Difference]: Without dead ends: 333248 [2025-03-08 06:18:30,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15756 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5470, Invalid=33536, Unknown=0, NotChecked=0, Total=39006 [2025-03-08 06:18:30,500 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 17945 mSDsluCounter, 3764 mSDsCounter, 0 mSdLazyCounter, 6169 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17945 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 6520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 6169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:30,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17945 Valid, 4246 Invalid, 6520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 6169 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 06:18:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333248 states. [2025-03-08 06:18:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333248 to 205101. [2025-03-08 06:18:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205101 states, 205100 states have (on average 1.3405021940516821) internal successors, (274937), 205100 states have internal predecessors, (274937), 0 states have call successors, (0), 0 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-08 06:18:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205101 states to 205101 states and 274937 transitions. [2025-03-08 06:18:33,550 INFO L78 Accepts]: Start accepts. Automaton has 205101 states and 274937 transitions. Word has length 89 [2025-03-08 06:18:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:33,550 INFO L471 AbstractCegarLoop]: Abstraction has 205101 states and 274937 transitions. [2025-03-08 06:18:33,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.846153846153847) internal successors, (256), 26 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-08 06:18:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 205101 states and 274937 transitions. [2025-03-08 06:18:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:18:33,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:33,560 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] [2025-03-08 06:18:33,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:18:33,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:18:33,761 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-08 06:18:33,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:33,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1561795995, now seen corresponding path program 1 times [2025-03-08 06:18:33,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:33,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322336138] [2025-03-08 06:18:33,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:33,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:33,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:18:33,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:18:33,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:33,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:33,827 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-08 06:18:33,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:33,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322336138] [2025-03-08 06:18:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322336138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:33,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:18:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573878451] [2025-03-08 06:18:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:33,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:18:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:33,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:18:33,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:18:33,829 INFO L87 Difference]: Start difference. First operand 205101 states and 274937 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:36,424 INFO L93 Difference]: Finished difference Result 467399 states and 627575 transitions. [2025-03-08 06:18:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:18:36,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 06:18:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:36,808 INFO L225 Difference]: With dead ends: 467399 [2025-03-08 06:18:36,808 INFO L226 Difference]: Without dead ends: 263070 [2025-03-08 06:18:37,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:18:37,140 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 852 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:37,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 745 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:18:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263070 states. [2025-03-08 06:18:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263070 to 217337. [2025-03-08 06:18:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217337 states, 217336 states have (on average 1.31679979386756) internal successors, (286188), 217336 states have internal predecessors, (286188), 0 states have call successors, (0), 0 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-08 06:18:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217337 states to 217337 states and 286188 transitions. [2025-03-08 06:18:40,627 INFO L78 Accepts]: Start accepts. Automaton has 217337 states and 286188 transitions. Word has length 92 [2025-03-08 06:18:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:40,627 INFO L471 AbstractCegarLoop]: Abstraction has 217337 states and 286188 transitions. [2025-03-08 06:18:40,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 217337 states and 286188 transitions. [2025-03-08 06:18:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 06:18:40,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:40,635 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] [2025-03-08 06:18:40,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:18:40,636 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-08 06:18:40,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:40,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1636140707, now seen corresponding path program 1 times [2025-03-08 06:18:40,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:40,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028400554] [2025-03-08 06:18:40,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:40,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:40,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 06:18:40,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 06:18:40,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:40,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:40,843 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-08 06:18:40,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:40,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028400554] [2025-03-08 06:18:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028400554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:40,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:40,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:18:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433971110] [2025-03-08 06:18:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:40,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:18:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:40,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:18:40,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:18:40,846 INFO L87 Difference]: Start difference. First operand 217337 states and 286188 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:42,431 INFO L93 Difference]: Finished difference Result 440228 states and 577190 transitions. [2025-03-08 06:18:42,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:18:42,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-08 06:18:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:42,858 INFO L225 Difference]: With dead ends: 440228 [2025-03-08 06:18:42,858 INFO L226 Difference]: Without dead ends: 223407 [2025-03-08 06:18:42,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 06:18:42,947 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 883 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:42,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 641 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:18:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223407 states. [2025-03-08 06:18:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223407 to 209215. [2025-03-08 06:18:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209215 states, 209214 states have (on average 1.2814104218646936) internal successors, (268089), 209214 states have internal predecessors, (268089), 0 states have call successors, (0), 0 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-08 06:18:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209215 states to 209215 states and 268089 transitions. [2025-03-08 06:18:46,064 INFO L78 Accepts]: Start accepts. Automaton has 209215 states and 268089 transitions. Word has length 93 [2025-03-08 06:18:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:46,064 INFO L471 AbstractCegarLoop]: Abstraction has 209215 states and 268089 transitions. [2025-03-08 06:18:46,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 209215 states and 268089 transitions. [2025-03-08 06:18:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 06:18:46,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:46,073 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] [2025-03-08 06:18:46,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:18:46,074 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-08 06:18:46,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1523884168, now seen corresponding path program 1 times [2025-03-08 06:18:46,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:46,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543740753] [2025-03-08 06:18:46,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:46,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 06:18:46,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 06:18:46,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:46,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:46,147 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-08 06:18:46,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:46,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543740753] [2025-03-08 06:18:46,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543740753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:46,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:46,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:46,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492923009] [2025-03-08 06:18:46,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:46,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:46,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:46,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:46,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:46,149 INFO L87 Difference]: Start difference. First operand 209215 states and 268089 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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-08 06:18:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:47,068 INFO L93 Difference]: Finished difference Result 258300 states and 330384 transitions. [2025-03-08 06:18:47,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:47,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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-08 06:18:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:47,258 INFO L225 Difference]: With dead ends: 258300 [2025-03-08 06:18:47,258 INFO L226 Difference]: Without dead ends: 158321 [2025-03-08 06:18:47,312 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-08 06:18:47,312 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 161 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:47,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 817 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158321 states. [2025-03-08 06:18:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158321 to 153933. [2025-03-08 06:18:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153933 states, 153932 states have (on average 1.2709832913234416) internal successors, (195645), 153932 states have internal predecessors, (195645), 0 states have call successors, (0), 0 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-08 06:18:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153933 states to 153933 states and 195645 transitions. [2025-03-08 06:18:49,305 INFO L78 Accepts]: Start accepts. Automaton has 153933 states and 195645 transitions. Word has length 93 [2025-03-08 06:18:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:49,305 INFO L471 AbstractCegarLoop]: Abstraction has 153933 states and 195645 transitions. [2025-03-08 06:18:49,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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-08 06:18:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 153933 states and 195645 transitions. [2025-03-08 06:18:49,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:18:49,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:49,313 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] [2025-03-08 06:18:49,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:18:49,313 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-08 06:18:49,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:49,314 INFO L85 PathProgramCache]: Analyzing trace with hash -270972295, now seen corresponding path program 1 times [2025-03-08 06:18:49,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:49,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977566021] [2025-03-08 06:18:49,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:49,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:49,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:18:49,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:18:49,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:49,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:49,386 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-08 06:18:49,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:49,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977566021] [2025-03-08 06:18:49,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977566021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:49,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:49,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:49,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383299646] [2025-03-08 06:18:49,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:49,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:49,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:49,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:49,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:49,388 INFO L87 Difference]: Start difference. First operand 153933 states and 195645 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:49,907 INFO L93 Difference]: Finished difference Result 194929 states and 247263 transitions. [2025-03-08 06:18:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:49,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:18:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:50,045 INFO L225 Difference]: With dead ends: 194929 [2025-03-08 06:18:50,045 INFO L226 Difference]: Without dead ends: 106045 [2025-03-08 06:18:50,114 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-08 06:18:50,114 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 168 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:50,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 775 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106045 states. [2025-03-08 06:18:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106045 to 105911. [2025-03-08 06:18:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105911 states, 105910 states have (on average 1.2568218298555378) internal successors, (133110), 105910 states have internal predecessors, (133110), 0 states have call successors, (0), 0 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-08 06:18:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105911 states to 105911 states and 133110 transitions. [2025-03-08 06:18:51,674 INFO L78 Accepts]: Start accepts. Automaton has 105911 states and 133110 transitions. Word has length 94 [2025-03-08 06:18:51,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:51,674 INFO L471 AbstractCegarLoop]: Abstraction has 105911 states and 133110 transitions. [2025-03-08 06:18:51,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 105911 states and 133110 transitions. [2025-03-08 06:18:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:18:51,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:51,680 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] [2025-03-08 06:18:51,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:18:51,680 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-08 06:18:51,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1013718146, now seen corresponding path program 1 times [2025-03-08 06:18:51,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:51,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567637906] [2025-03-08 06:18:51,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:51,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:51,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:18:51,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:18:51,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:51,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 06:18:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567637906] [2025-03-08 06:18:51,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567637906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:51,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:51,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:51,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473523167] [2025-03-08 06:18:51,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:51,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:51,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:51,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:51,716 INFO L87 Difference]: Start difference. First operand 105911 states and 133110 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:51,996 INFO L93 Difference]: Finished difference Result 138500 states and 173912 transitions. [2025-03-08 06:18:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:51,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:18:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:52,067 INFO L225 Difference]: With dead ends: 138500 [2025-03-08 06:18:52,067 INFO L226 Difference]: Without dead ends: 67237 [2025-03-08 06:18:52,110 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-08 06:18:52,110 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 164 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:52,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 829 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67237 states. [2025-03-08 06:18:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67237 to 66965. [2025-03-08 06:18:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66965 states, 66964 states have (on average 1.2371423451406727) internal successors, (82844), 66964 states have internal predecessors, (82844), 0 states have call successors, (0), 0 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-08 06:18:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66965 states to 66965 states and 82844 transitions. [2025-03-08 06:18:52,889 INFO L78 Accepts]: Start accepts. Automaton has 66965 states and 82844 transitions. Word has length 95 [2025-03-08 06:18:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:52,889 INFO L471 AbstractCegarLoop]: Abstraction has 66965 states and 82844 transitions. [2025-03-08 06:18:52,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 66965 states and 82844 transitions. [2025-03-08 06:18:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:18:52,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:52,894 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] [2025-03-08 06:18:52,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:18:52,894 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:52,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash -657255070, now seen corresponding path program 1 times [2025-03-08 06:18:52,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:52,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280536849] [2025-03-08 06:18:52,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:52,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:52,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:18:52,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:18:52,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:52,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 06:18:52,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:52,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280536849] [2025-03-08 06:18:52,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280536849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:52,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:52,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:18:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224940004] [2025-03-08 06:18:52,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:52,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:18:52,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:52,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:18:52,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:18:52,939 INFO L87 Difference]: Start difference. First operand 66965 states and 82844 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:53,617 INFO L93 Difference]: Finished difference Result 130302 states and 161355 transitions. [2025-03-08 06:18:53,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:18:53,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:18:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:53,756 INFO L225 Difference]: With dead ends: 130302 [2025-03-08 06:18:53,756 INFO L226 Difference]: Without dead ends: 107449 [2025-03-08 06:18:53,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:18:53,796 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 329 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:53,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 914 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:18:53,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107449 states. [2025-03-08 06:18:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107449 to 78770. [2025-03-08 06:18:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78770 states, 78769 states have (on average 1.2383424951440287) internal successors, (97543), 78769 states have internal predecessors, (97543), 0 states have call successors, (0), 0 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-08 06:18:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78770 states to 78770 states and 97543 transitions. [2025-03-08 06:18:55,037 INFO L78 Accepts]: Start accepts. Automaton has 78770 states and 97543 transitions. Word has length 96 [2025-03-08 06:18:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:55,038 INFO L471 AbstractCegarLoop]: Abstraction has 78770 states and 97543 transitions. [2025-03-08 06:18:55,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 78770 states and 97543 transitions. [2025-03-08 06:18:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:18:55,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:55,042 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, 1, 1, 1] [2025-03-08 06:18:55,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:18:55,043 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:55,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:55,043 INFO L85 PathProgramCache]: Analyzing trace with hash -149220866, now seen corresponding path program 1 times [2025-03-08 06:18:55,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:55,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389319495] [2025-03-08 06:18:55,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:55,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:55,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:18:55,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:18:55,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:55,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:55,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:55,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389319495] [2025-03-08 06:18:55,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389319495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:18:55,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218179815] [2025-03-08 06:18:55,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:55,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:18:55,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:18:55,096 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-08 06:18:55,098 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-08 06:18:55,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:18:55,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:18:55,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:55,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:55,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:18:55,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:18:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:55,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:18:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:55,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218179815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:18:55,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:18:55,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-08 06:18:55,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531182193] [2025-03-08 06:18:55,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:18:55,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:18:55,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:55,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:18:55,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:18:55,563 INFO L87 Difference]: Start difference. First operand 78770 states and 97543 transitions. Second operand has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 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-08 06:18:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:56,198 INFO L93 Difference]: Finished difference Result 171843 states and 212862 transitions. [2025-03-08 06:18:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:18:56,198 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:18:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:56,319 INFO L225 Difference]: With dead ends: 171843 [2025-03-08 06:18:56,319 INFO L226 Difference]: Without dead ends: 93574 [2025-03-08 06:18:56,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:18:56,379 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 3228 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3228 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:56,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3228 Valid, 1037 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:18:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93574 states. [2025-03-08 06:18:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93574 to 83545. [2025-03-08 06:18:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83545 states, 83544 states have (on average 1.2207938331896964) internal successors, (101990), 83544 states have internal predecessors, (101990), 0 states have call successors, (0), 0 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-08 06:18:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83545 states to 83545 states and 101990 transitions. [2025-03-08 06:18:57,693 INFO L78 Accepts]: Start accepts. Automaton has 83545 states and 101990 transitions. Word has length 96 [2025-03-08 06:18:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:57,693 INFO L471 AbstractCegarLoop]: Abstraction has 83545 states and 101990 transitions. [2025-03-08 06:18:57,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 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-08 06:18:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 83545 states and 101990 transitions. [2025-03-08 06:18:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:18:57,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:57,698 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, 1, 1, 1, 1] [2025-03-08 06:18:57,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:18:57,898 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,SelfDestructingSolverStorable37 [2025-03-08 06:18:57,899 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:57,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:57,899 INFO L85 PathProgramCache]: Analyzing trace with hash -414542948, now seen corresponding path program 1 times [2025-03-08 06:18:57,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:57,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660868755] [2025-03-08 06:18:57,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:57,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:18:57,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:18:57,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:57,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:57,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:57,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660868755] [2025-03-08 06:18:57,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660868755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:57,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:57,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:57,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827637195] [2025-03-08 06:18:57,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:57,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:57,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:57,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:57,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:57,936 INFO L87 Difference]: Start difference. First operand 83545 states and 101990 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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) [2025-03-08 06:18:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:58,239 INFO L93 Difference]: Finished difference Result 171579 states and 209461 transitions. [2025-03-08 06:18:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:58,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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) Word has length 97 [2025-03-08 06:18:58,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:58,386 INFO L225 Difference]: With dead ends: 171579 [2025-03-08 06:18:58,386 INFO L226 Difference]: Without dead ends: 134916 [2025-03-08 06:18:58,438 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-08 06:18:58,439 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 156 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:58,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 903 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134916 states. [2025-03-08 06:18:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134916 to 88406. [2025-03-08 06:18:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88406 states, 88405 states have (on average 1.2140263559753408) internal successors, (107326), 88405 states have internal predecessors, (107326), 0 states have call successors, (0), 0 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-08 06:18:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88406 states to 88406 states and 107326 transitions. [2025-03-08 06:18:59,791 INFO L78 Accepts]: Start accepts. Automaton has 88406 states and 107326 transitions. Word has length 97 [2025-03-08 06:18:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:59,791 INFO L471 AbstractCegarLoop]: Abstraction has 88406 states and 107326 transitions. [2025-03-08 06:18:59,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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) [2025-03-08 06:18:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 88406 states and 107326 transitions. [2025-03-08 06:18:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:18:59,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:59,798 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, 1, 1, 1, 1, 1] [2025-03-08 06:18:59,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:18:59,798 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:18:59,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash -671950284, now seen corresponding path program 1 times [2025-03-08 06:18:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:59,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473637620] [2025-03-08 06:18:59,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:59,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:18:59,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:18:59,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:59,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:19:00,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:00,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473637620] [2025-03-08 06:19:00,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473637620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:00,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:00,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:19:00,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129581810] [2025-03-08 06:19:00,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:00,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:19:00,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:00,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:19:00,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:19:00,023 INFO L87 Difference]: Start difference. First operand 88406 states and 107326 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 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-08 06:19:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:01,024 INFO L93 Difference]: Finished difference Result 193020 states and 233960 transitions. [2025-03-08 06:19:01,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:19:01,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-08 06:19:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:01,182 INFO L225 Difference]: With dead ends: 193020 [2025-03-08 06:19:01,182 INFO L226 Difference]: Without dead ends: 139498 [2025-03-08 06:19:01,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:19:01,244 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 1103 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:01,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1399 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:19:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139498 states. [2025-03-08 06:19:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139498 to 134483. [2025-03-08 06:19:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134483 states, 134482 states have (on average 1.211470680091016) internal successors, (162921), 134482 states have internal predecessors, (162921), 0 states have call successors, (0), 0 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-08 06:19:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134483 states to 134483 states and 162921 transitions. [2025-03-08 06:19:02,973 INFO L78 Accepts]: Start accepts. Automaton has 134483 states and 162921 transitions. Word has length 98 [2025-03-08 06:19:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:19:02,973 INFO L471 AbstractCegarLoop]: Abstraction has 134483 states and 162921 transitions. [2025-03-08 06:19:02,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 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-08 06:19:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 134483 states and 162921 transitions. [2025-03-08 06:19:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:19:02,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:19:02,979 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, 1, 1, 1, 1, 1, 1] [2025-03-08 06:19:02,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 06:19:02,979 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:19:02,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:19:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2124844374, now seen corresponding path program 1 times [2025-03-08 06:19:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:19:02,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445895689] [2025-03-08 06:19:02,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:19:02,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:19:02,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:19:03,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:19:03,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:19:03,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:19:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 06:19:03,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:19:03,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445895689] [2025-03-08 06:19:03,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445895689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:19:03,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:19:03,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:19:03,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272766136] [2025-03-08 06:19:03,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:19:03,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:19:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:19:03,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:19:03,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:19:03,131 INFO L87 Difference]: Start difference. First operand 134483 states and 162921 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:19:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:19:03,920 INFO L93 Difference]: Finished difference Result 251876 states and 305112 transitions. [2025-03-08 06:19:03,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 06:19:03,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-08 06:19:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:19:04,177 INFO L225 Difference]: With dead ends: 251876 [2025-03-08 06:19:04,177 INFO L226 Difference]: Without dead ends: 213012 [2025-03-08 06:19:04,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:19:04,252 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 2264 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2264 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:19:04,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2264 Valid, 989 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:19:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213012 states.