./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.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-?-8fc3dc6-m [2025-03-16 19:25:30,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:25:30,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:25:30,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:25:30,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:25:30,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:25:30,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:25:30,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:25:30,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:25:30,628 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:25:30,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:25:30,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:25:30,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:25:30,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:25:30,629 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:25:30,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:25:30,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:25:30,629 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:25:30,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:25:30,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:25:30,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:25:30,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:25:30,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:25:30,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:25:30,630 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:25:30,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:25:30,630 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:25:30,630 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:25:30,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:25:30,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:25:30,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:25:30,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:25:30,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:25:30,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:25:30,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:25:30,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:25:30,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:25:30,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:25:30,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:25:30,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:25:30,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:25:30,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:25:30,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:25:30,632 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-16 19:25:30,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:25:30,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:25:30,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:25:30,885 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:25:30,886 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:25:30,886 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-16 19:25:31,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1887e3d52/4895e2da3c4749b087daa8fcf9f32245/FLAG557b39c98 [2025-03-16 19:25:32,352 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:25:32,352 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-16 19:25:32,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1887e3d52/4895e2da3c4749b087daa8fcf9f32245/FLAG557b39c98 [2025-03-16 19:25:32,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1887e3d52/4895e2da3c4749b087daa8fcf9f32245 [2025-03-16 19:25:32,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:25:32,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:25:32,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:25:32,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:25:32,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:25:32,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:25:32" (1/1) ... [2025-03-16 19:25:32,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4448f301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:32, skipping insertion in model container [2025-03-16 19:25:32,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:25:32" (1/1) ... [2025-03-16 19:25:32,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:25:32,815 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-16 19:25:32,834 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-16 19:25:32,858 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-16 19:25:32,880 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-16 19:25:32,916 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-16 19:25:32,965 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-16 19:25:33,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:25:33,070 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:25:33,096 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-16 19:25:33,101 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-16 19:25:33,112 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-16 19:25:33,120 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-16 19:25:33,144 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-16 19:25:33,188 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-16 19:25:33,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:25:33,257 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:25:33,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33 WrapperNode [2025-03-16 19:25:33,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:25:33,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:25:33,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:25:33,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:25:33,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,396 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6039 [2025-03-16 19:25:33,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:25:33,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:25:33,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:25:33,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:25:33,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,472 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:25:33,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:25:33,608 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:25:33,608 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:25:33,608 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:25:33,608 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (1/1) ... [2025-03-16 19:25:33,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:25:33,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:33,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:25:33,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:25:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:25:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:25:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:25:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:25:33,841 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:25:33,842 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:25:36,343 INFO L1322 $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-16 19:25:36,344 INFO L1322 $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-16 19:25:36,345 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6446: havoc main_~node3__m3~28#1; [2025-03-16 19:25:36,345 INFO L1322 $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-16 19:25:36,346 INFO L1322 $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-16 19:25:36,346 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L241: havoc main_~node3__m3~0#1; [2025-03-16 19:25:36,346 INFO L1322 $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-16 19:25:36,346 INFO L1322 $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-16 19:25:36,347 INFO L1322 $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-16 19:25:36,347 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6586: havoc main_~node1____CPAchecker_TMP_0~10#1; [2025-03-16 19:25:36,347 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7512: havoc main_~node2__m2~38#1; [2025-03-16 19:25:36,347 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6456: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-16 19:25:36,348 INFO L1322 $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-16 19:25:36,348 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5400: havoc main_~node1____CPAchecker_TMP_0~8#1; [2025-03-16 19:25:36,348 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7386: havoc main_~node1____CPAchecker_TMP_0~13#1; [2025-03-16 19:25:36,348 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L251: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:25:36,348 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2233: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:25:36,348 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2762: havoc main_~node3__m3~11#1; [2025-03-16 19:25:36,348 INFO L1322 $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-16 19:25:36,348 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2105: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-16 19:25:36,348 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7788: havoc main_~node2__m2~40#1; [2025-03-16 19:25:36,348 INFO L1322 $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-16 19:25:36,348 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4882: havoc main_~node1____CPAchecker_TMP_1~5#1; [2025-03-16 19:25:36,349 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4354: havoc main_~node1____CPAchecker_TMP_0~5#1; [2025-03-16 19:25:36,349 INFO L1322 $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-16 19:25:36,349 INFO L1322 $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-16 19:25:36,349 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6867: havoc main_~node1____CPAchecker_TMP_1~10#1; [2025-03-16 19:25:36,349 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7396: havoc main_~node2__m2~37#1; [2025-03-16 19:25:36,349 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2243: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:25:36,349 INFO L1322 $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-16 19:25:36,349 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:25:36,349 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3301: havoc main_~node2__m2~17#1; [2025-03-16 19:25:36,349 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4756: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-16 19:25:36,349 INFO L1322 $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-16 19:25:36,349 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5154: havoc main_~node1____CPAchecker_TMP_0~7#1; [2025-03-16 19:25:36,349 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7665: havoc main_~node2____CPAchecker_TMP_1~7#1;havoc main_~node2__m2~39#1; [2025-03-16 19:25:36,349 INFO L1322 $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-16 19:25:36,349 INFO L1322 $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-16 19:25:36,349 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7798: havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-03-16 19:25:36,349 INFO L1322 $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-16 19:25:36,349 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9781: havoc main_~node3__m3~42#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4629: havoc main_~node2__m2~24#1;havoc main_~node1____CPAchecker_TMP_0~6#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7140: havoc main_~node1____CPAchecker_TMP_0~12#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1195: havoc main_~node3__m3~5#1; [2025-03-16 19:25:36,350 INFO L1322 $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-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6614: havoc main_~node1____CPAchecker_TMP_1~9#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3311: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:25:36,350 INFO L1322 $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-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1596: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7807: havoc main_~node3__m3~33#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5429: havoc main_~node1____CPAchecker_TMP_1~7#1; [2025-03-16 19:25:36,350 INFO L1322 $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-16 19:25:36,350 INFO L1322 $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-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9791: havoc main_~node3____CPAchecker_TMP_0~12#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1205: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:25:36,350 INFO L1322 $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-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3320: havoc main_~node3__m3~12#1; [2025-03-16 19:25:36,350 INFO L1322 $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-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3721: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7817: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4382: havoc main_~node1____CPAchecker_TMP_1~4#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10065: havoc main_~node2____CPAchecker_TMP_0~9#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3330: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4784: havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7559: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-16 19:25:36,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8617: havoc main_~node1____CPAchecker_TMP_1~15#1; [2025-03-16 19:25:36,351 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5182: havoc main_~node1____CPAchecker_TMP_1~6#1; [2025-03-16 19:25:36,351 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7168: havoc main_~node1____CPAchecker_TMP_1~11#1; [2025-03-16 19:25:36,351 INFO L1322 $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-16 19:25:36,352 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1624: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-16 19:25:36,352 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5456: havoc main_~node2__m2~27#1; [2025-03-16 19:25:36,352 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6910: havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2__m2~34#1; [2025-03-16 19:25:36,352 INFO L1322 $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-16 19:25:36,352 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7443: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-16 19:25:36,352 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671: havoc main_~node3__m3~20#1; [2025-03-16 19:25:36,352 INFO L1322 $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-16 19:25:36,352 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5466: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-16 19:25:36,352 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3749: havoc main_~node1____CPAchecker_TMP_1~3#1; [2025-03-16 19:25:36,352 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:25:36,352 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10093: havoc main_~node2____CPAchecker_TMP_1~11#1; [2025-03-16 19:25:36,353 INFO L1322 $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-16 19:25:36,353 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8644: havoc main_~node2__m2~44#1; [2025-03-16 19:25:36,353 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7587: havoc main_~node2____CPAchecker_TMP_1~6#1; [2025-03-16 19:25:36,353 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5605: havoc main_~node3__m3~23#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-16 19:25:36,353 INFO L1322 $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-16 19:25:36,353 INFO L1322 $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-16 19:25:36,353 INFO L1322 $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-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6006: havoc main_~node1____CPAchecker_TMP_0~9#1; [2025-03-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4819: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9048: havoc main_~node2____CPAchecker_TMP_0~8#1; [2025-03-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8389: havoc main_~node3__m3~36#1; [2025-03-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5615: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8654: havoc main_~node2____CPAchecker_TMP_0~7#1; [2025-03-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4167: havoc main_~node3__m3~17#1; [2025-03-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7471: havoc main_~node2____CPAchecker_TMP_1~5#1; [2025-03-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8399: havoc main_~node3____CPAchecker_TMP_0~10#1; [2025-03-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5494: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L474: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4177: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $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-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9205: havoc main_~node3__m3~39#1;havoc main_~node2____CPAchecker_TMP_1~10#1; [2025-03-16 19:25:36,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6034: havoc main_~node1____CPAchecker_TMP_1~8#1; [2025-03-16 19:25:36,355 INFO L1322 $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-16 19:25:36,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc main_~node2__m2~0#1; [2025-03-16 19:25:36,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4847: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:25:36,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7622: havoc main_~node1____CPAchecker_TMP_1~12#1; [2025-03-16 19:25:36,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9076: havoc main_~node2____CPAchecker_TMP_1~9#1; [2025-03-16 19:25:36,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc main_~check__tmp~32#1; [2025-03-16 19:25:36,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8682: havoc main_~node2____CPAchecker_TMP_1~8#1; [2025-03-16 19:25:36,356 INFO L1322 $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-16 19:25:36,356 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2077: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-16 19:25:36,356 INFO L1322 $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-16 19:25:36,356 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9215: havoc main_~node3____CPAchecker_TMP_0~11#1; [2025-03-16 19:25:36,356 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7762: havoc main_~node1____CPAchecker_TMP_1~13#1; [2025-03-16 19:25:36,357 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6838: havoc main_~node1____CPAchecker_TMP_0~11#1; [2025-03-16 19:25:36,357 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L232: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:25:36,507 INFO L? ?]: Removed 1041 outVars from TransFormulas that were not future-live. [2025-03-16 19:25:36,507 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:25:36,539 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:25:36,539 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:25:36,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:25:36 BoogieIcfgContainer [2025-03-16 19:25:36,540 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:25:36,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:25:36,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:25:36,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:25:36,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:25:32" (1/3) ... [2025-03-16 19:25:36,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b84d31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:25:36, skipping insertion in model container [2025-03-16 19:25:36,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:33" (2/3) ... [2025-03-16 19:25:36,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b84d31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:25:36, skipping insertion in model container [2025-03-16 19:25:36,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:25:36" (3/3) ... [2025-03-16 19:25:36,547 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:25:36,559 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:25:36,562 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, 1253 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-16 19:25:36,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:25:36,644 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;@51dc8487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:25:36,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-16 19:25:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 1253 states, 1246 states have (on average 1.804975922953451) internal successors, (2249), 1252 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:25:36,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:36,665 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] [2025-03-16 19:25:36,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:36,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash 451631179, now seen corresponding path program 1 times [2025-03-16 19:25:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121257919] [2025-03-16 19:25:36,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:36,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:25:36,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:25:36,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:36,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:37,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121257919] [2025-03-16 19:25:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121257919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:37,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:37,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:25:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095315490] [2025-03-16 19:25:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:37,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:37,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:37,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:37,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:37,113 INFO L87 Difference]: Start difference. First operand has 1253 states, 1246 states have (on average 1.804975922953451) internal successors, (2249), 1252 states have internal predecessors, (2249), 0 states have call successors, (0), 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.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:38,396 INFO L93 Difference]: Finished difference Result 2466 states and 4322 transitions. [2025-03-16 19:25:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:38,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-16 19:25:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:38,414 INFO L225 Difference]: With dead ends: 2466 [2025-03-16 19:25:38,414 INFO L226 Difference]: Without dead ends: 1549 [2025-03-16 19:25:38,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:38,425 INFO L435 NwaCegarLoop]: 1012 mSDtfsCounter, 7057 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7057 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:38,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7057 Valid, 1490 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:25:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-03-16 19:25:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1543. [2025-03-16 19:25:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1537 states have (on average 1.3565387117761873) internal successors, (2085), 1542 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2085 transitions. [2025-03-16 19:25:38,515 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2085 transitions. Word has length 50 [2025-03-16 19:25:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:38,515 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2085 transitions. [2025-03-16 19:25:38,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2085 transitions. [2025-03-16 19:25:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:25:38,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:38,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:38,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:25:38,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:38,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:38,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1080491380, now seen corresponding path program 1 times [2025-03-16 19:25:38,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:38,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774030773] [2025-03-16 19:25:38,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:38,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:38,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:25:38,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:25:38,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:38,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:38,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:38,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774030773] [2025-03-16 19:25:38,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774030773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:38,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:38,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:25:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329409003] [2025-03-16 19:25:38,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:38,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:38,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:38,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:38,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:38,699 INFO L87 Difference]: Start difference. First operand 1543 states and 2085 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:39,454 INFO L93 Difference]: Finished difference Result 3068 states and 4221 transitions. [2025-03-16 19:25:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:39,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 19:25:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:39,460 INFO L225 Difference]: With dead ends: 3068 [2025-03-16 19:25:39,461 INFO L226 Difference]: Without dead ends: 1980 [2025-03-16 19:25:39,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:39,463 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 4621 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4621 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:39,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4621 Valid, 901 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:25:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2025-03-16 19:25:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1970. [2025-03-16 19:25:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1964 states have (on average 1.3691446028513239) internal successors, (2689), 1969 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2689 transitions. [2025-03-16 19:25:39,498 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2689 transitions. Word has length 51 [2025-03-16 19:25:39,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:39,498 INFO L471 AbstractCegarLoop]: Abstraction has 1970 states and 2689 transitions. [2025-03-16 19:25:39,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-16 19:25:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2689 transitions. [2025-03-16 19:25:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:25:39,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:39,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] [2025-03-16 19:25:39,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:25:39,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:39,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:39,502 INFO L85 PathProgramCache]: Analyzing trace with hash -727146725, now seen corresponding path program 1 times [2025-03-16 19:25:39,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:39,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489019163] [2025-03-16 19:25:39,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:39,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:39,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:25:39,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:25:39,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:39,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:39,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:39,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489019163] [2025-03-16 19:25:39,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489019163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:39,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:39,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:25:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813984549] [2025-03-16 19:25:39,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:39,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:39,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:39,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:39,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:39,652 INFO L87 Difference]: Start difference. First operand 1970 states and 2689 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:40,370 INFO L93 Difference]: Finished difference Result 4373 states and 6010 transitions. [2025-03-16 19:25:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:40,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 19:25:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:40,379 INFO L225 Difference]: With dead ends: 4373 [2025-03-16 19:25:40,380 INFO L226 Difference]: Without dead ends: 3046 [2025-03-16 19:25:40,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:40,383 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 4567 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:40,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 967 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:25:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2025-03-16 19:25:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 3034. [2025-03-16 19:25:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3028 states have (on average 1.3768163804491413) internal successors, (4169), 3033 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-16 19:25:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4169 transitions. [2025-03-16 19:25:40,435 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4169 transitions. Word has length 51 [2025-03-16 19:25:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:40,436 INFO L471 AbstractCegarLoop]: Abstraction has 3034 states and 4169 transitions. [2025-03-16 19:25:40,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4169 transitions. [2025-03-16 19:25:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:25:40,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:40,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:40,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:25:40,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:40,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:40,440 INFO L85 PathProgramCache]: Analyzing trace with hash -704871301, now seen corresponding path program 1 times [2025-03-16 19:25:40,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:40,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659353311] [2025-03-16 19:25:40,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:40,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:40,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:25:40,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:25:40,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:40,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659353311] [2025-03-16 19:25:40,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659353311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:40,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:40,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:25:40,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669844035] [2025-03-16 19:25:40,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:40,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:25:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:40,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:25:40,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:40,708 INFO L87 Difference]: Start difference. First operand 3034 states and 4169 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:41,803 INFO L93 Difference]: Finished difference Result 4346 states and 6072 transitions. [2025-03-16 19:25:41,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:25:41,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 19:25:41,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:41,813 INFO L225 Difference]: With dead ends: 4346 [2025-03-16 19:25:41,813 INFO L226 Difference]: Without dead ends: 3675 [2025-03-16 19:25:41,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:25:41,817 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 2292 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2292 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:41,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2292 Valid, 2522 Invalid, 2194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:25:41,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2025-03-16 19:25:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 3034. [2025-03-16 19:25:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3028 states have (on average 1.3764861294583883) internal successors, (4168), 3033 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-16 19:25:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4168 transitions. [2025-03-16 19:25:41,874 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4168 transitions. Word has length 52 [2025-03-16 19:25:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:41,874 INFO L471 AbstractCegarLoop]: Abstraction has 3034 states and 4168 transitions. [2025-03-16 19:25:41,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4168 transitions. [2025-03-16 19:25:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:25:41,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:41,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:41,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:25:41,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:41,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:41,878 INFO L85 PathProgramCache]: Analyzing trace with hash -539701917, now seen corresponding path program 1 times [2025-03-16 19:25:41,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:41,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485237033] [2025-03-16 19:25:41,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:41,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:41,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:25:41,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:25:41,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:41,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:42,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:42,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485237033] [2025-03-16 19:25:42,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485237033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:42,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:42,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:25:42,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715199407] [2025-03-16 19:25:42,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:42,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:25:42,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:42,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:25:42,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:25:42,182 INFO L87 Difference]: Start difference. First operand 3034 states and 4168 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:43,889 INFO L93 Difference]: Finished difference Result 5326 states and 7444 transitions. [2025-03-16 19:25:43,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:25:43,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 19:25:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:43,901 INFO L225 Difference]: With dead ends: 5326 [2025-03-16 19:25:43,902 INFO L226 Difference]: Without dead ends: 4769 [2025-03-16 19:25:43,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:25:43,904 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 3823 mSDsluCounter, 3088 mSDsCounter, 0 mSdLazyCounter, 3980 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3823 SdHoareTripleChecker+Valid, 3876 SdHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:43,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3823 Valid, 3876 Invalid, 4032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 3980 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 19:25:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2025-03-16 19:25:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 3034. [2025-03-16 19:25:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3028 states have (on average 1.3761558784676353) internal successors, (4167), 3033 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-16 19:25:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4167 transitions. [2025-03-16 19:25:43,972 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4167 transitions. Word has length 52 [2025-03-16 19:25:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:43,972 INFO L471 AbstractCegarLoop]: Abstraction has 3034 states and 4167 transitions. [2025-03-16 19:25:43,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4167 transitions. [2025-03-16 19:25:43,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:25:43,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:43,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:43,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:25:43,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:43,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash 948878107, now seen corresponding path program 1 times [2025-03-16 19:25:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:43,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644128021] [2025-03-16 19:25:43,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:43,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:43,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:25:44,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:25:44,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:44,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:44,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644128021] [2025-03-16 19:25:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644128021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:44,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:25:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762461284] [2025-03-16 19:25:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:25:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:44,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:25:44,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:25:44,176 INFO L87 Difference]: Start difference. First operand 3034 states and 4167 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:45,299 INFO L93 Difference]: Finished difference Result 3792 states and 5174 transitions. [2025-03-16 19:25:45,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:25:45,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 19:25:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:45,308 INFO L225 Difference]: With dead ends: 3792 [2025-03-16 19:25:45,308 INFO L226 Difference]: Without dead ends: 3787 [2025-03-16 19:25:45,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:25:45,309 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 2408 mSDsluCounter, 2650 mSDsCounter, 0 mSdLazyCounter, 3177 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2408 SdHoareTripleChecker+Valid, 3299 SdHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:45,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2408 Valid, 3299 Invalid, 3210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3177 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:25:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2025-03-16 19:25:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3034. [2025-03-16 19:25:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3028 states have (on average 1.3758256274768825) internal successors, (4166), 3033 states have internal predecessors, (4166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4166 transitions. [2025-03-16 19:25:45,352 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4166 transitions. Word has length 52 [2025-03-16 19:25:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:45,352 INFO L471 AbstractCegarLoop]: Abstraction has 3034 states and 4166 transitions. [2025-03-16 19:25:45,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4166 transitions. [2025-03-16 19:25:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:25:45,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:45,354 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-16 19:25:45,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:25:45,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:45,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1974433639, now seen corresponding path program 1 times [2025-03-16 19:25:45,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:45,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396320352] [2025-03-16 19:25:45,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:45,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:45,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:25:45,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:25:45,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:45,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:45,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:45,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396320352] [2025-03-16 19:25:45,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396320352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:45,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:45,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:45,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151005004] [2025-03-16 19:25:45,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:45,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:45,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:45,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:45,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:45,403 INFO L87 Difference]: Start difference. First operand 3034 states and 4166 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-16 19:25:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:45,489 INFO L93 Difference]: Finished difference Result 5416 states and 7597 transitions. [2025-03-16 19:25:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:45,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-16 19:25:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:45,498 INFO L225 Difference]: With dead ends: 5416 [2025-03-16 19:25:45,498 INFO L226 Difference]: Without dead ends: 3779 [2025-03-16 19:25:45,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:45,501 INFO L435 NwaCegarLoop]: 1251 mSDtfsCounter, 659 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:45,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2046 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:25:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3779 states. [2025-03-16 19:25:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3779 to 3773. [2025-03-16 19:25:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3773 states, 3767 states have (on average 1.3700557472790018) internal successors, (5161), 3772 states have internal predecessors, (5161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 5161 transitions. [2025-03-16 19:25:45,550 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 5161 transitions. Word has length 53 [2025-03-16 19:25:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:45,551 INFO L471 AbstractCegarLoop]: Abstraction has 3773 states and 5161 transitions. [2025-03-16 19:25:45,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-16 19:25:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 5161 transitions. [2025-03-16 19:25:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:25:45,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:45,554 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-16 19:25:45,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:25:45,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:45,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1543782650, now seen corresponding path program 1 times [2025-03-16 19:25:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:45,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752793635] [2025-03-16 19:25:45,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:45,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:25:45,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:25:45,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:45,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752793635] [2025-03-16 19:25:45,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752793635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:45,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:45,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437449726] [2025-03-16 19:25:45,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:45,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:45,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:45,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:45,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:45,612 INFO L87 Difference]: Start difference. First operand 3773 states and 5161 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-16 19:25:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:45,663 INFO L93 Difference]: Finished difference Result 5473 states and 7754 transitions. [2025-03-16 19:25:45,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:45,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-16 19:25:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:45,680 INFO L225 Difference]: With dead ends: 5473 [2025-03-16 19:25:45,682 INFO L226 Difference]: Without dead ends: 4172 [2025-03-16 19:25:45,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:45,686 INFO L435 NwaCegarLoop]: 1152 mSDtfsCounter, 563 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:45,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1735 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2025-03-16 19:25:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 4170. [2025-03-16 19:25:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 4164 states have (on average 1.3873679154658982) internal successors, (5777), 4169 states have internal predecessors, (5777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 5777 transitions. [2025-03-16 19:25:45,741 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 5777 transitions. Word has length 53 [2025-03-16 19:25:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:45,741 INFO L471 AbstractCegarLoop]: Abstraction has 4170 states and 5777 transitions. [2025-03-16 19:25:45,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-16 19:25:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5777 transitions. [2025-03-16 19:25:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:25:45,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:45,745 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-16 19:25:45,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:25:45,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:45,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:45,745 INFO L85 PathProgramCache]: Analyzing trace with hash -890527719, now seen corresponding path program 1 times [2025-03-16 19:25:45,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:45,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439875184] [2025-03-16 19:25:45,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:45,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:45,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:25:45,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:25:45,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:45,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:45,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439875184] [2025-03-16 19:25:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439875184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:45,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:45,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:45,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55641993] [2025-03-16 19:25:45,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:45,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:45,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:45,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:45,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:45,797 INFO L87 Difference]: Start difference. First operand 4170 states and 5777 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-16 19:25:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:45,849 INFO L93 Difference]: Finished difference Result 7091 states and 10231 transitions. [2025-03-16 19:25:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-16 19:25:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:45,857 INFO L225 Difference]: With dead ends: 7091 [2025-03-16 19:25:45,857 INFO L226 Difference]: Without dead ends: 5148 [2025-03-16 19:25:45,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:45,861 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 560 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:45,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1693 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5148 states. [2025-03-16 19:25:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5148 to 5146. [2025-03-16 19:25:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5146 states, 5140 states have (on average 1.4134241245136188) internal successors, (7265), 5145 states have internal predecessors, (7265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 7265 transitions. [2025-03-16 19:25:45,951 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 7265 transitions. Word has length 53 [2025-03-16 19:25:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:45,951 INFO L471 AbstractCegarLoop]: Abstraction has 5146 states and 7265 transitions. [2025-03-16 19:25:45,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-16 19:25:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 7265 transitions. [2025-03-16 19:25:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:25:45,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:45,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:45,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:25:45,955 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-16 19:25:45,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash 241590166, now seen corresponding path program 1 times [2025-03-16 19:25:45,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:45,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264705741] [2025-03-16 19:25:45,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:45,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:45,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:25:45,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:25:45,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:45,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:45,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:45,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264705741] [2025-03-16 19:25:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264705741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:45,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:45,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:45,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382911643] [2025-03-16 19:25:45,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:45,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:45,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:45,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:45,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:45,999 INFO L87 Difference]: Start difference. First operand 5146 states and 7265 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-16 19:25:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:46,123 INFO L93 Difference]: Finished difference Result 9730 states and 13905 transitions. [2025-03-16 19:25:46,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:46,123 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-16 19:25:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:46,131 INFO L225 Difference]: With dead ends: 9730 [2025-03-16 19:25:46,131 INFO L226 Difference]: Without dead ends: 5090 [2025-03-16 19:25:46,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:46,137 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 857 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:46,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1488 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:25:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2025-03-16 19:25:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 4007. [2025-03-16 19:25:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 4001 states have (on average 1.4226443389152712) internal successors, (5692), 4006 states have internal predecessors, (5692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5692 transitions. [2025-03-16 19:25:46,184 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5692 transitions. Word has length 54 [2025-03-16 19:25:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:46,184 INFO L471 AbstractCegarLoop]: Abstraction has 4007 states and 5692 transitions. [2025-03-16 19:25:46,184 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-16 19:25:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5692 transitions. [2025-03-16 19:25:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:25:46,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:46,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:46,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:25:46,186 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-16 19:25:46,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:46,187 INFO L85 PathProgramCache]: Analyzing trace with hash -164961610, now seen corresponding path program 1 times [2025-03-16 19:25:46,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:46,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281654144] [2025-03-16 19:25:46,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:46,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:46,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:25:46,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:25:46,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:46,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:46,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:46,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281654144] [2025-03-16 19:25:46,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281654144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:46,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:46,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:46,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568940880] [2025-03-16 19:25:46,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:46,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:46,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:46,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:46,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:46,225 INFO L87 Difference]: Start difference. First operand 4007 states and 5692 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-16 19:25:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:46,305 INFO L93 Difference]: Finished difference Result 7835 states and 11357 transitions. [2025-03-16 19:25:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:46,305 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-16 19:25:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:46,311 INFO L225 Difference]: With dead ends: 7835 [2025-03-16 19:25:46,311 INFO L226 Difference]: Without dead ends: 4441 [2025-03-16 19:25:46,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:46,314 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 720 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:46,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1052 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:25:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4441 states. [2025-03-16 19:25:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4441 to 3587. [2025-03-16 19:25:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 3582 states have (on average 1.43606923506421) internal successors, (5144), 3586 states have internal predecessors, (5144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 5144 transitions. [2025-03-16 19:25:46,346 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 5144 transitions. Word has length 54 [2025-03-16 19:25:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:46,346 INFO L471 AbstractCegarLoop]: Abstraction has 3587 states and 5144 transitions. [2025-03-16 19:25:46,346 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-16 19:25:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 5144 transitions. [2025-03-16 19:25:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:25:46,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:46,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:46,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:25:46,348 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-16 19:25:46,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1146039657, now seen corresponding path program 1 times [2025-03-16 19:25:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769663210] [2025-03-16 19:25:46,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:46,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:25:46,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:25:46,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:46,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:46,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:46,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769663210] [2025-03-16 19:25:46,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769663210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:46,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:46,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056419761] [2025-03-16 19:25:46,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:46,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:46,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:46,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:46,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:46,384 INFO L87 Difference]: Start difference. First operand 3587 states and 5144 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-16 19:25:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:46,441 INFO L93 Difference]: Finished difference Result 7274 states and 10601 transitions. [2025-03-16 19:25:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:46,442 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-16 19:25:46,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:46,447 INFO L225 Difference]: With dead ends: 7274 [2025-03-16 19:25:46,448 INFO L226 Difference]: Without dead ends: 4097 [2025-03-16 19:25:46,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:46,452 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 577 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:46,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 816 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2025-03-16 19:25:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 3303. [2025-03-16 19:25:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3299 states have (on average 1.4483176720218247) internal successors, (4778), 3302 states have internal predecessors, (4778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4778 transitions. [2025-03-16 19:25:46,484 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4778 transitions. Word has length 54 [2025-03-16 19:25:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:46,484 INFO L471 AbstractCegarLoop]: Abstraction has 3303 states and 4778 transitions. [2025-03-16 19:25:46,484 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-16 19:25:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4778 transitions. [2025-03-16 19:25:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:25:46,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:46,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:46,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:25:46,485 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:46,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1160819005, now seen corresponding path program 1 times [2025-03-16 19:25:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:46,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144826082] [2025-03-16 19:25:46,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:46,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:46,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:25:46,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:25:46,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:46,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:46,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:46,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144826082] [2025-03-16 19:25:46,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144826082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:46,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:46,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:25:46,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949256953] [2025-03-16 19:25:46,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:46,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:25:46,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:46,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:25:46,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:25:46,984 INFO L87 Difference]: Start difference. First operand 3303 states and 4778 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:47,788 INFO L93 Difference]: Finished difference Result 9188 states and 13455 transitions. [2025-03-16 19:25:47,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:25:47,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 19:25:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:47,802 INFO L225 Difference]: With dead ends: 9188 [2025-03-16 19:25:47,802 INFO L226 Difference]: Without dead ends: 9184 [2025-03-16 19:25:47,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:25:47,806 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 4089 mSDsluCounter, 3171 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 3738 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:47,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4089 Valid, 3738 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:25:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9184 states. [2025-03-16 19:25:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9184 to 3299. [2025-03-16 19:25:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 3296 states have (on average 1.4484223300970873) internal successors, (4774), 3298 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4774 transitions. [2025-03-16 19:25:47,860 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4774 transitions. Word has length 55 [2025-03-16 19:25:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:47,860 INFO L471 AbstractCegarLoop]: Abstraction has 3299 states and 4774 transitions. [2025-03-16 19:25:47,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:47,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4774 transitions. [2025-03-16 19:25:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:25:47,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:47,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:47,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:25:47,861 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-16 19:25:47,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash -454408876, now seen corresponding path program 1 times [2025-03-16 19:25:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346724857] [2025-03-16 19:25:47,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:47,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:25:47,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:25:47,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:47,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:48,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:48,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346724857] [2025-03-16 19:25:48,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346724857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:48,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:48,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 19:25:48,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055358078] [2025-03-16 19:25:48,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:48,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:25:48,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:48,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:25:48,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:25:48,497 INFO L87 Difference]: Start difference. First operand 3299 states and 4774 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:50,271 INFO L93 Difference]: Finished difference Result 6144 states and 8903 transitions. [2025-03-16 19:25:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:25:50,271 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 19:25:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:50,279 INFO L225 Difference]: With dead ends: 6144 [2025-03-16 19:25:50,279 INFO L226 Difference]: Without dead ends: 6140 [2025-03-16 19:25:50,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:25:50,281 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 3154 mSDsluCounter, 7160 mSDsCounter, 0 mSdLazyCounter, 3057 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3154 SdHoareTripleChecker+Valid, 7783 SdHoareTripleChecker+Invalid, 3064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:50,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3154 Valid, 7783 Invalid, 3064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3057 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:25:50,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6140 states. [2025-03-16 19:25:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6140 to 3306. [2025-03-16 19:25:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3306 states, 3303 states have (on average 1.4480775052982138) internal successors, (4783), 3305 states have internal predecessors, (4783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4783 transitions. [2025-03-16 19:25:50,315 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4783 transitions. Word has length 55 [2025-03-16 19:25:50,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:50,315 INFO L471 AbstractCegarLoop]: Abstraction has 3306 states and 4783 transitions. [2025-03-16 19:25:50,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4783 transitions. [2025-03-16 19:25:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:25:50,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:50,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:50,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:25:50,316 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-16 19:25:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:50,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2124484633, now seen corresponding path program 1 times [2025-03-16 19:25:50,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:50,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243043653] [2025-03-16 19:25:50,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:50,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:50,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:25:50,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:25:50,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:50,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:50,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:50,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243043653] [2025-03-16 19:25:50,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243043653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:50,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:50,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:25:50,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777305283] [2025-03-16 19:25:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:50,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:25:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:50,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:25:50,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:25:50,669 INFO L87 Difference]: Start difference. First operand 3306 states and 4783 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:51,440 INFO L93 Difference]: Finished difference Result 6529 states and 9483 transitions. [2025-03-16 19:25:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:25:51,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 19:25:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:51,450 INFO L225 Difference]: With dead ends: 6529 [2025-03-16 19:25:51,450 INFO L226 Difference]: Without dead ends: 6468 [2025-03-16 19:25:51,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:25:51,455 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 3585 mSDsluCounter, 3661 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3585 SdHoareTripleChecker+Valid, 4348 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:51,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3585 Valid, 4348 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:25:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6468 states. [2025-03-16 19:25:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6468 to 3294. [2025-03-16 19:25:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3292 states have (on average 1.4486634264884568) internal successors, (4769), 3293 states have internal predecessors, (4769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4769 transitions. [2025-03-16 19:25:51,498 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4769 transitions. Word has length 55 [2025-03-16 19:25:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:51,498 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 4769 transitions. [2025-03-16 19:25:51,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4769 transitions. [2025-03-16 19:25:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 19:25:51,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:51,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:51,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:25:51,500 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:51,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash -284680570, now seen corresponding path program 1 times [2025-03-16 19:25:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:51,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838792073] [2025-03-16 19:25:51,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:51,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:51,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 19:25:51,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 19:25:51,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:51,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:52,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:52,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838792073] [2025-03-16 19:25:52,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838792073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:52,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:52,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 19:25:52,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838020197] [2025-03-16 19:25:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:52,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:25:52,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:52,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:25:52,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:25:52,110 INFO L87 Difference]: Start difference. First operand 3294 states and 4769 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:54,107 INFO L93 Difference]: Finished difference Result 5670 states and 8179 transitions. [2025-03-16 19:25:54,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 19:25:54,107 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-16 19:25:54,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:54,115 INFO L225 Difference]: With dead ends: 5670 [2025-03-16 19:25:54,115 INFO L226 Difference]: Without dead ends: 5666 [2025-03-16 19:25:54,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=815, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:25:54,117 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 3409 mSDsluCounter, 7266 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3409 SdHoareTripleChecker+Valid, 7880 SdHoareTripleChecker+Invalid, 2966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:54,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3409 Valid, 7880 Invalid, 2966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:25:54,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5666 states. [2025-03-16 19:25:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5666 to 3283. [2025-03-16 19:25:54,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3283 states, 3282 states have (on average 1.4491163924436319) internal successors, (4756), 3282 states have internal predecessors, (4756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3283 states to 3283 states and 4756 transitions. [2025-03-16 19:25:54,168 INFO L78 Accepts]: Start accepts. Automaton has 3283 states and 4756 transitions. Word has length 56 [2025-03-16 19:25:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:54,168 INFO L471 AbstractCegarLoop]: Abstraction has 3283 states and 4756 transitions. [2025-03-16 19:25:54,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3283 states and 4756 transitions. [2025-03-16 19:25:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:25:54,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:54,171 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] [2025-03-16 19:25:54,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:25:54,171 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-16 19:25:54,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1492386405, now seen corresponding path program 1 times [2025-03-16 19:25:54,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:54,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574249707] [2025-03-16 19:25:54,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:54,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:25:54,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:25:54,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:54,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:54,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:54,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574249707] [2025-03-16 19:25:54,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574249707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:54,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:54,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:54,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043547759] [2025-03-16 19:25:54,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:54,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:54,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:54,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:54,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:54,253 INFO L87 Difference]: Start difference. First operand 3283 states and 4756 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:54,339 INFO L93 Difference]: Finished difference Result 10240 states and 15149 transitions. [2025-03-16 19:25:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:54,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-16 19:25:54,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:54,352 INFO L225 Difference]: With dead ends: 10240 [2025-03-16 19:25:54,352 INFO L226 Difference]: Without dead ends: 7518 [2025-03-16 19:25:54,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:54,356 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1619 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:54,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 1227 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:25:54,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7518 states. [2025-03-16 19:25:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7518 to 5702. [2025-03-16 19:25:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5702 states, 5701 states have (on average 1.4472899491317313) internal successors, (8251), 5701 states have internal predecessors, (8251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5702 states to 5702 states and 8251 transitions. [2025-03-16 19:25:54,410 INFO L78 Accepts]: Start accepts. Automaton has 5702 states and 8251 transitions. Word has length 62 [2025-03-16 19:25:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:54,410 INFO L471 AbstractCegarLoop]: Abstraction has 5702 states and 8251 transitions. [2025-03-16 19:25:54,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5702 states and 8251 transitions. [2025-03-16 19:25:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:25:54,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:54,412 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-16 19:25:54,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:25:54,412 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-16 19:25:54,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:54,413 INFO L85 PathProgramCache]: Analyzing trace with hash -913002864, now seen corresponding path program 1 times [2025-03-16 19:25:54,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638900189] [2025-03-16 19:25:54,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:54,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:25:54,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:25:54,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:54,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:54,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:54,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638900189] [2025-03-16 19:25:54,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638900189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:54,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:54,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:54,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300399938] [2025-03-16 19:25:54,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:54,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:54,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:54,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:54,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:54,477 INFO L87 Difference]: Start difference. First operand 5702 states and 8251 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-16 19:25:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:54,544 INFO L93 Difference]: Finished difference Result 8934 states and 12970 transitions. [2025-03-16 19:25:54,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:54,544 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-16 19:25:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:54,548 INFO L225 Difference]: With dead ends: 8934 [2025-03-16 19:25:54,548 INFO L226 Difference]: Without dead ends: 3772 [2025-03-16 19:25:54,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:54,553 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1217 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:54,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 941 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2025-03-16 19:25:54,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 3768. [2025-03-16 19:25:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3768 states, 3767 states have (on average 1.421290151314043) internal successors, (5354), 3767 states have internal predecessors, (5354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 5354 transitions. [2025-03-16 19:25:54,593 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 5354 transitions. Word has length 63 [2025-03-16 19:25:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:54,594 INFO L471 AbstractCegarLoop]: Abstraction has 3768 states and 5354 transitions. [2025-03-16 19:25:54,594 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-16 19:25:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 5354 transitions. [2025-03-16 19:25:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:25:54,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:54,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:54,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:25:54,596 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:54,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:54,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1859955816, now seen corresponding path program 1 times [2025-03-16 19:25:54,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:54,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097510708] [2025-03-16 19:25:54,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:54,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:54,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:25:54,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:25:54,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:54,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:54,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:54,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097510708] [2025-03-16 19:25:54,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097510708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:54,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:54,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:54,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111717665] [2025-03-16 19:25:54,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:54,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:54,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:54,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:54,666 INFO L87 Difference]: Start difference. First operand 3768 states and 5354 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:54,720 INFO L93 Difference]: Finished difference Result 9910 states and 14280 transitions. [2025-03-16 19:25:54,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:54,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 19:25:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:54,729 INFO L225 Difference]: With dead ends: 9910 [2025-03-16 19:25:54,730 INFO L226 Difference]: Without dead ends: 6682 [2025-03-16 19:25:54,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:54,734 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 323 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:54,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 903 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:54,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6682 states. [2025-03-16 19:25:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6682 to 6264. [2025-03-16 19:25:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6264 states, 6263 states have (on average 1.4277502794188088) internal successors, (8942), 6263 states have internal predecessors, (8942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6264 states to 6264 states and 8942 transitions. [2025-03-16 19:25:54,808 INFO L78 Accepts]: Start accepts. Automaton has 6264 states and 8942 transitions. Word has length 65 [2025-03-16 19:25:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:54,809 INFO L471 AbstractCegarLoop]: Abstraction has 6264 states and 8942 transitions. [2025-03-16 19:25:54,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6264 states and 8942 transitions. [2025-03-16 19:25:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:25:54,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:54,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:54,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:25:54,810 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:54,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2017529176, now seen corresponding path program 1 times [2025-03-16 19:25:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:54,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162576480] [2025-03-16 19:25:54,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:54,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:25:54,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:25:54,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:54,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:54,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:54,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162576480] [2025-03-16 19:25:54,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162576480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:54,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:54,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:54,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327859503] [2025-03-16 19:25:54,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:54,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:54,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:54,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:54,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:54,868 INFO L87 Difference]: Start difference. First operand 6264 states and 8942 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-16 19:25:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:54,930 INFO L93 Difference]: Finished difference Result 17084 states and 24536 transitions. [2025-03-16 19:25:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:54,931 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-16 19:25:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:54,942 INFO L225 Difference]: With dead ends: 17084 [2025-03-16 19:25:54,942 INFO L226 Difference]: Without dead ends: 11338 [2025-03-16 19:25:54,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:54,950 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 360 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:54,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 848 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:54,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11338 states. [2025-03-16 19:25:55,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11338 to 10504. [2025-03-16 19:25:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10504 states, 10503 states have (on average 1.4236884699609635) internal successors, (14953), 10503 states have internal predecessors, (14953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10504 states to 10504 states and 14953 transitions. [2025-03-16 19:25:55,058 INFO L78 Accepts]: Start accepts. Automaton has 10504 states and 14953 transitions. Word has length 66 [2025-03-16 19:25:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:55,058 INFO L471 AbstractCegarLoop]: Abstraction has 10504 states and 14953 transitions. [2025-03-16 19:25:55,058 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-16 19:25:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 10504 states and 14953 transitions. [2025-03-16 19:25:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:25:55,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:55,059 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-16 19:25:55,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:25:55,059 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:55,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:55,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1443353169, now seen corresponding path program 1 times [2025-03-16 19:25:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:55,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947882555] [2025-03-16 19:25:55,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:55,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:55,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:25:55,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:25:55,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:55,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:55,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:55,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947882555] [2025-03-16 19:25:55,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947882555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:55,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:55,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:25:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946629546] [2025-03-16 19:25:55,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:55,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:25:55,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:55,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:25:55,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:25:55,198 INFO L87 Difference]: Start difference. First operand 10504 states and 14953 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-16 19:25:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:55,236 INFO L93 Difference]: Finished difference Result 11394 states and 16138 transitions. [2025-03-16 19:25:55,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:25:55,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-16 19:25:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:55,246 INFO L225 Difference]: With dead ends: 11394 [2025-03-16 19:25:55,247 INFO L226 Difference]: Without dead ends: 11392 [2025-03-16 19:25:55,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:25:55,250 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 0 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2760 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-16 19:25:55,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2760 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11392 states. [2025-03-16 19:25:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11392 to 11392. [2025-03-16 19:25:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11392 states, 11391 states have (on average 1.3906592924238435) internal successors, (15841), 11391 states have internal predecessors, (15841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11392 states to 11392 states and 15841 transitions. [2025-03-16 19:25:55,402 INFO L78 Accepts]: Start accepts. Automaton has 11392 states and 15841 transitions. Word has length 67 [2025-03-16 19:25:55,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:55,402 INFO L471 AbstractCegarLoop]: Abstraction has 11392 states and 15841 transitions. [2025-03-16 19:25:55,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-16 19:25:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 11392 states and 15841 transitions. [2025-03-16 19:25:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:25:55,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:55,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:55,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:25:55,405 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:55,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1980144804, now seen corresponding path program 1 times [2025-03-16 19:25:55,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:55,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150146760] [2025-03-16 19:25:55,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:55,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:25:55,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:25:55,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:55,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:55,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:55,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150146760] [2025-03-16 19:25:55,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150146760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:55,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:55,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:55,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933836735] [2025-03-16 19:25:55,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:55,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:55,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:55,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:55,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:55,446 INFO L87 Difference]: Start difference. First operand 11392 states and 15841 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:55,534 INFO L93 Difference]: Finished difference Result 30718 states and 42838 transitions. [2025-03-16 19:25:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:55,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:25:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:55,556 INFO L225 Difference]: With dead ends: 30718 [2025-03-16 19:25:55,556 INFO L226 Difference]: Without dead ends: 19826 [2025-03-16 19:25:55,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:55,572 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 317 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:55,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 810 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19826 states. [2025-03-16 19:25:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19826 to 19528. [2025-03-16 19:25:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19528 states, 19527 states have (on average 1.3662108874891177) internal successors, (26678), 19527 states have internal predecessors, (26678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19528 states to 19528 states and 26678 transitions. [2025-03-16 19:25:55,752 INFO L78 Accepts]: Start accepts. Automaton has 19528 states and 26678 transitions. Word has length 68 [2025-03-16 19:25:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:55,752 INFO L471 AbstractCegarLoop]: Abstraction has 19528 states and 26678 transitions. [2025-03-16 19:25:55,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 19528 states and 26678 transitions. [2025-03-16 19:25:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:25:55,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:55,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:55,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:25:55,755 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:55,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:55,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1393015291, now seen corresponding path program 1 times [2025-03-16 19:25:55,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:55,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437708242] [2025-03-16 19:25:55,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:55,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:55,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:25:55,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:25:55,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:55,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:55,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:55,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437708242] [2025-03-16 19:25:55,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437708242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:55,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:55,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:55,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647786646] [2025-03-16 19:25:55,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:55,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:55,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:55,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:55,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:55,826 INFO L87 Difference]: Start difference. First operand 19528 states and 26678 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:55,942 INFO L93 Difference]: Finished difference Result 34362 states and 47116 transitions. [2025-03-16 19:25:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:55,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 19:25:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:55,971 INFO L225 Difference]: With dead ends: 34362 [2025-03-16 19:25:55,972 INFO L226 Difference]: Without dead ends: 28108 [2025-03-16 19:25:55,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:55,985 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 1075 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:55,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1389 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28108 states. [2025-03-16 19:25:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28108 to 24481. [2025-03-16 19:25:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24481 states, 24480 states have (on average 1.3613970588235293) internal successors, (33327), 24480 states have internal predecessors, (33327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24481 states to 24481 states and 33327 transitions. [2025-03-16 19:25:56,269 INFO L78 Accepts]: Start accepts. Automaton has 24481 states and 33327 transitions. Word has length 72 [2025-03-16 19:25:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:56,269 INFO L471 AbstractCegarLoop]: Abstraction has 24481 states and 33327 transitions. [2025-03-16 19:25:56,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 24481 states and 33327 transitions. [2025-03-16 19:25:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:25:56,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:56,271 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-16 19:25:56,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:25:56,271 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:56,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1520815932, now seen corresponding path program 1 times [2025-03-16 19:25:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:56,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708433462] [2025-03-16 19:25:56,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:56,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:25:56,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:25:56,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:56,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:56,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708433462] [2025-03-16 19:25:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708433462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:56,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:56,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791344745] [2025-03-16 19:25:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:56,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:56,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:56,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:56,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:56,342 INFO L87 Difference]: Start difference. First operand 24481 states and 33327 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-16 19:25:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:56,461 INFO L93 Difference]: Finished difference Result 37745 states and 51503 transitions. [2025-03-16 19:25:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:56,462 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-16 19:25:56,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:56,498 INFO L225 Difference]: With dead ends: 37745 [2025-03-16 19:25:56,499 INFO L226 Difference]: Without dead ends: 31451 [2025-03-16 19:25:56,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:56,517 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 1099 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:56,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1341 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31451 states. [2025-03-16 19:25:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31451 to 29457. [2025-03-16 19:25:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29457 states, 29456 states have (on average 1.356973112438892) internal successors, (39971), 29456 states have internal predecessors, (39971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29457 states to 29457 states and 39971 transitions. [2025-03-16 19:25:56,885 INFO L78 Accepts]: Start accepts. Automaton has 29457 states and 39971 transitions. Word has length 73 [2025-03-16 19:25:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:56,885 INFO L471 AbstractCegarLoop]: Abstraction has 29457 states and 39971 transitions. [2025-03-16 19:25:56,886 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-16 19:25:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 29457 states and 39971 transitions. [2025-03-16 19:25:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:25:56,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:56,887 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-16 19:25:56,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:25:56,888 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:56,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2065406146, now seen corresponding path program 1 times [2025-03-16 19:25:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:56,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657791648] [2025-03-16 19:25:56,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:56,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:56,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:25:56,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:25:56,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:56,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657791648] [2025-03-16 19:25:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657791648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:56,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:56,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:56,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142020995] [2025-03-16 19:25:56,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:56,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:56,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:56,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:56,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:56,958 INFO L87 Difference]: Start difference. First operand 29457 states and 39971 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-16 19:25:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:57,083 INFO L93 Difference]: Finished difference Result 42658 states and 58164 transitions. [2025-03-16 19:25:57,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:57,083 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-16 19:25:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:57,122 INFO L225 Difference]: With dead ends: 42658 [2025-03-16 19:25:57,122 INFO L226 Difference]: Without dead ends: 36404 [2025-03-16 19:25:57,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:57,137 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 1066 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:57,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1372 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36404 states. [2025-03-16 19:25:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36404 to 34410. [2025-03-16 19:25:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34410 states, 34409 states have (on average 1.3548780842221513) internal successors, (46620), 34409 states have internal predecessors, (46620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34410 states to 34410 states and 46620 transitions. [2025-03-16 19:25:57,609 INFO L78 Accepts]: Start accepts. Automaton has 34410 states and 46620 transitions. Word has length 73 [2025-03-16 19:25:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:57,610 INFO L471 AbstractCegarLoop]: Abstraction has 34410 states and 46620 transitions. [2025-03-16 19:25:57,610 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-16 19:25:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 34410 states and 46620 transitions. [2025-03-16 19:25:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:25:57,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:57,614 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] [2025-03-16 19:25:57,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:25:57,614 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:57,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:57,614 INFO L85 PathProgramCache]: Analyzing trace with hash -721342118, now seen corresponding path program 1 times [2025-03-16 19:25:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:57,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057710865] [2025-03-16 19:25:57,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:57,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:57,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:25:57,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:25:57,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:57,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:57,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:57,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057710865] [2025-03-16 19:25:57,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057710865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:57,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:57,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419989064] [2025-03-16 19:25:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:57,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:57,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:57,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:57,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:57,735 INFO L87 Difference]: Start difference. First operand 34410 states and 46620 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:57,894 INFO L93 Difference]: Finished difference Result 47332 states and 64259 transitions. [2025-03-16 19:25:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:57,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-16 19:25:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:57,933 INFO L225 Difference]: With dead ends: 47332 [2025-03-16 19:25:57,933 INFO L226 Difference]: Without dead ends: 36126 [2025-03-16 19:25:57,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:57,949 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 1059 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:57,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1384 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36126 states. [2025-03-16 19:25:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36126 to 34134. [2025-03-16 19:25:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34134 states, 34133 states have (on average 1.3523569566109044) internal successors, (46160), 34133 states have internal predecessors, (46160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34134 states to 34134 states and 46160 transitions. [2025-03-16 19:25:58,378 INFO L78 Accepts]: Start accepts. Automaton has 34134 states and 46160 transitions. Word has length 80 [2025-03-16 19:25:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:58,379 INFO L471 AbstractCegarLoop]: Abstraction has 34134 states and 46160 transitions. [2025-03-16 19:25:58,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 34134 states and 46160 transitions. [2025-03-16 19:25:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:25:58,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:58,382 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] [2025-03-16 19:25:58,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:25:58,382 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:58,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash 442281703, now seen corresponding path program 1 times [2025-03-16 19:25:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:58,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983366687] [2025-03-16 19:25:58,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:58,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:58,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:25:58,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:25:58,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:58,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:58,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:58,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983366687] [2025-03-16 19:25:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983366687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:58,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904008177] [2025-03-16 19:25:58,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:58,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:58,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:58,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:58,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:58,506 INFO L87 Difference]: Start difference. First operand 34134 states and 46160 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:58,672 INFO L93 Difference]: Finished difference Result 47056 states and 63799 transitions. [2025-03-16 19:25:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:58,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-16 19:25:58,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:58,728 INFO L225 Difference]: With dead ends: 47056 [2025-03-16 19:25:58,729 INFO L226 Difference]: Without dead ends: 35850 [2025-03-16 19:25:58,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:58,747 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1056 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:58,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1375 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2025-03-16 19:25:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 33858. [2025-03-16 19:25:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33858 states, 33857 states have (on average 1.3497947248722568) internal successors, (45700), 33857 states have internal predecessors, (45700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33858 states to 33858 states and 45700 transitions. [2025-03-16 19:25:59,130 INFO L78 Accepts]: Start accepts. Automaton has 33858 states and 45700 transitions. Word has length 80 [2025-03-16 19:25:59,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:59,130 INFO L471 AbstractCegarLoop]: Abstraction has 33858 states and 45700 transitions. [2025-03-16 19:25:59,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 33858 states and 45700 transitions. [2025-03-16 19:25:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:25:59,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:59,133 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] [2025-03-16 19:25:59,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:25:59,133 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:59,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:59,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1109951428, now seen corresponding path program 1 times [2025-03-16 19:25:59,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:59,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24267673] [2025-03-16 19:25:59,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:59,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:59,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:25:59,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:25:59,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:59,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:59,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:59,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24267673] [2025-03-16 19:25:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24267673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:59,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:59,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:59,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463452810] [2025-03-16 19:25:59,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:59,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:59,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:59,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:59,216 INFO L87 Difference]: Start difference. First operand 33858 states and 45700 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:59,351 INFO L93 Difference]: Finished difference Result 46844 states and 63323 transitions. [2025-03-16 19:25:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:59,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-16 19:25:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:59,392 INFO L225 Difference]: With dead ends: 46844 [2025-03-16 19:25:59,392 INFO L226 Difference]: Without dead ends: 35574 [2025-03-16 19:25:59,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:59,410 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 1083 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:59,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1334 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35574 states. [2025-03-16 19:25:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35574 to 33582. [2025-03-16 19:25:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33582 states, 33581 states have (on average 1.347190375509961) internal successors, (45240), 33581 states have internal predecessors, (45240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33582 states to 33582 states and 45240 transitions. [2025-03-16 19:25:59,710 INFO L78 Accepts]: Start accepts. Automaton has 33582 states and 45240 transitions. Word has length 80 [2025-03-16 19:25:59,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:59,711 INFO L471 AbstractCegarLoop]: Abstraction has 33582 states and 45240 transitions. [2025-03-16 19:25:59,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 33582 states and 45240 transitions. [2025-03-16 19:25:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:25:59,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:59,714 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-16 19:25:59,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:25:59,714 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:25:59,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:59,714 INFO L85 PathProgramCache]: Analyzing trace with hash 968356909, now seen corresponding path program 1 times [2025-03-16 19:25:59,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:59,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123909554] [2025-03-16 19:25:59,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:59,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:59,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:25:59,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:25:59,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:59,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:59,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123909554] [2025-03-16 19:25:59,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123909554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:59,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:59,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:25:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390160686] [2025-03-16 19:25:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:59,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:25:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:59,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:25:59,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:59,796 INFO L87 Difference]: Start difference. First operand 33582 states and 45240 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 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-16 19:26:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:00,324 INFO L93 Difference]: Finished difference Result 41016 states and 55180 transitions. [2025-03-16 19:26:00,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:00,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 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-16 19:26:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:00,369 INFO L225 Difference]: With dead ends: 41016 [2025-03-16 19:26:00,369 INFO L226 Difference]: Without dead ends: 40468 [2025-03-16 19:26:00,382 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-16 19:26:00,383 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 2216 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:00,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2216 Valid, 694 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:26:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40468 states. [2025-03-16 19:26:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40468 to 33581. [2025-03-16 19:26:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33581 states, 33580 states have (on average 1.3471411554496724) internal successors, (45237), 33580 states have internal predecessors, (45237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33581 states to 33581 states and 45237 transitions. [2025-03-16 19:26:00,713 INFO L78 Accepts]: Start accepts. Automaton has 33581 states and 45237 transitions. Word has length 81 [2025-03-16 19:26:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:00,713 INFO L471 AbstractCegarLoop]: Abstraction has 33581 states and 45237 transitions. [2025-03-16 19:26:00,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 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-16 19:26:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 33581 states and 45237 transitions. [2025-03-16 19:26:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:26:00,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:00,716 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-16 19:26:00,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:26:00,717 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:26:00,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash -196119938, now seen corresponding path program 1 times [2025-03-16 19:26:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:00,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242078823] [2025-03-16 19:26:00,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:00,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:00,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:26:00,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:26:00,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:00,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:00,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:00,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242078823] [2025-03-16 19:26:00,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242078823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:00,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:00,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:00,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750900430] [2025-03-16 19:26:00,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:00,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:00,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:00,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:00,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:00,852 INFO L87 Difference]: Start difference. First operand 33581 states and 45237 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 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-16 19:26:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:01,214 INFO L93 Difference]: Finished difference Result 41015 states and 55177 transitions. [2025-03-16 19:26:01,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:01,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 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-16 19:26:01,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:01,258 INFO L225 Difference]: With dead ends: 41015 [2025-03-16 19:26:01,258 INFO L226 Difference]: Without dead ends: 40467 [2025-03-16 19:26:01,272 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-16 19:26:01,272 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 2220 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2220 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:01,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2220 Valid, 686 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:26:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40467 states. [2025-03-16 19:26:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40467 to 33580. [2025-03-16 19:26:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33580 states, 33579 states have (on average 1.3470919324577861) internal successors, (45234), 33579 states have internal predecessors, (45234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33580 states to 33580 states and 45234 transitions. [2025-03-16 19:26:01,685 INFO L78 Accepts]: Start accepts. Automaton has 33580 states and 45234 transitions. Word has length 81 [2025-03-16 19:26:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:01,685 INFO L471 AbstractCegarLoop]: Abstraction has 33580 states and 45234 transitions. [2025-03-16 19:26:01,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 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-16 19:26:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 33580 states and 45234 transitions. [2025-03-16 19:26:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:26:01,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:01,691 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] [2025-03-16 19:26:01,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:26:01,692 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:26:01,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1224043447, now seen corresponding path program 1 times [2025-03-16 19:26:01,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:01,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428435276] [2025-03-16 19:26:01,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:01,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:01,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:26:01,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:26:01,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:01,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:01,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:01,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428435276] [2025-03-16 19:26:01,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428435276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:01,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:01,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:26:01,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649289114] [2025-03-16 19:26:01,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:01,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:26:01,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:01,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:26:01,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:26:01,903 INFO L87 Difference]: Start difference. First operand 33580 states and 45234 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:02,765 INFO L93 Difference]: Finished difference Result 71904 states and 95778 transitions. [2025-03-16 19:26:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:26:02,766 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-16 19:26:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:02,833 INFO L225 Difference]: With dead ends: 71904 [2025-03-16 19:26:02,834 INFO L226 Difference]: Without dead ends: 56590 [2025-03-16 19:26:02,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:26:02,859 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 3329 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3329 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:02,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3329 Valid, 2007 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:26:02,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56590 states. [2025-03-16 19:26:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56590 to 34042. [2025-03-16 19:26:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34042 states, 34041 states have (on average 1.3456420199171588) internal successors, (45807), 34041 states have internal predecessors, (45807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34042 states to 34042 states and 45807 transitions. [2025-03-16 19:26:03,385 INFO L78 Accepts]: Start accepts. Automaton has 34042 states and 45807 transitions. Word has length 87 [2025-03-16 19:26:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:03,385 INFO L471 AbstractCegarLoop]: Abstraction has 34042 states and 45807 transitions. [2025-03-16 19:26:03,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 34042 states and 45807 transitions. [2025-03-16 19:26:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:26:03,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:03,392 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] [2025-03-16 19:26:03,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:26:03,393 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:26:03,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:03,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1257678719, now seen corresponding path program 1 times [2025-03-16 19:26:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:03,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784681918] [2025-03-16 19:26:03,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:03,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:26:03,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:26:03,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:03,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:26:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:03,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784681918] [2025-03-16 19:26:03,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784681918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:03,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:03,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:03,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826413127] [2025-03-16 19:26:03,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:03,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:03,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:03,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:03,623 INFO L87 Difference]: Start difference. First operand 34042 states and 45807 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:04,083 INFO L93 Difference]: Finished difference Result 64622 states and 87047 transitions. [2025-03-16 19:26:04,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:04,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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 88 [2025-03-16 19:26:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:04,137 INFO L225 Difference]: With dead ends: 64622 [2025-03-16 19:26:04,137 INFO L226 Difference]: Without dead ends: 49386 [2025-03-16 19:26:04,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:04,157 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 2016 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:04,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 995 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:26:04,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49386 states. [2025-03-16 19:26:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49386 to 34030. [2025-03-16 19:26:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34030 states, 34029 states have (on average 1.3457345205559963) internal successors, (45794), 34029 states have internal predecessors, (45794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34030 states to 34030 states and 45794 transitions. [2025-03-16 19:26:04,503 INFO L78 Accepts]: Start accepts. Automaton has 34030 states and 45794 transitions. Word has length 88 [2025-03-16 19:26:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:04,503 INFO L471 AbstractCegarLoop]: Abstraction has 34030 states and 45794 transitions. [2025-03-16 19:26:04,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 34030 states and 45794 transitions. [2025-03-16 19:26:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:26:04,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:04,510 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] [2025-03-16 19:26:04,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:26:04,510 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:26:04,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash -461727012, now seen corresponding path program 1 times [2025-03-16 19:26:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:04,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270524502] [2025-03-16 19:26:04,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:04,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:04,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:26:04,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:26:04,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:04,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:26:04,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270524502] [2025-03-16 19:26:04,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270524502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:04,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:04,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:26:04,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442307594] [2025-03-16 19:26:04,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:04,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:26:04,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:04,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:26:04,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:26:04,687 INFO L87 Difference]: Start difference. First operand 34030 states and 45794 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:05,354 INFO L93 Difference]: Finished difference Result 65644 states and 88106 transitions. [2025-03-16 19:26:05,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:26:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 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 88 [2025-03-16 19:26:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:05,409 INFO L225 Difference]: With dead ends: 65644 [2025-03-16 19:26:05,409 INFO L226 Difference]: Without dead ends: 50410 [2025-03-16 19:26:05,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:26:05,431 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 2076 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2076 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:05,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2076 Valid, 1328 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:26:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50410 states. [2025-03-16 19:26:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50410 to 34014. [2025-03-16 19:26:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34014 states, 34013 states have (on average 1.3458383559227354) internal successors, (45776), 34013 states have internal predecessors, (45776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34014 states to 34014 states and 45776 transitions. [2025-03-16 19:26:05,800 INFO L78 Accepts]: Start accepts. Automaton has 34014 states and 45776 transitions. Word has length 88 [2025-03-16 19:26:05,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:05,800 INFO L471 AbstractCegarLoop]: Abstraction has 34014 states and 45776 transitions. [2025-03-16 19:26:05,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 34014 states and 45776 transitions. [2025-03-16 19:26:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:26:05,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:05,807 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] [2025-03-16 19:26:05,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:26:05,808 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:26:05,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1728376835, now seen corresponding path program 1 times [2025-03-16 19:26:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:05,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500678378] [2025-03-16 19:26:05,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:05,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:05,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:26:05,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:26:05,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:05,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:26:05,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:05,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500678378] [2025-03-16 19:26:05,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500678378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:05,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:05,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:26:05,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278966722] [2025-03-16 19:26:05,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:05,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:26:05,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:05,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:26:05,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:26:05,935 INFO L87 Difference]: Start difference. First operand 34014 states and 45776 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:06,720 INFO L93 Difference]: Finished difference Result 70211 states and 93446 transitions. [2025-03-16 19:26:06,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:26:06,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 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 88 [2025-03-16 19:26:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:06,784 INFO L225 Difference]: With dead ends: 70211 [2025-03-16 19:26:06,784 INFO L226 Difference]: Without dead ends: 54736 [2025-03-16 19:26:06,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:26:06,802 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 1296 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:06,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1925 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:26:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54736 states. [2025-03-16 19:26:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54736 to 33994. [2025-03-16 19:26:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33994 states, 33993 states have (on average 1.345953578677963) internal successors, (45753), 33993 states have internal predecessors, (45753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33994 states to 33994 states and 45753 transitions. [2025-03-16 19:26:07,161 INFO L78 Accepts]: Start accepts. Automaton has 33994 states and 45753 transitions. Word has length 88 [2025-03-16 19:26:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:07,161 INFO L471 AbstractCegarLoop]: Abstraction has 33994 states and 45753 transitions. [2025-03-16 19:26:07,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 33994 states and 45753 transitions. [2025-03-16 19:26:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:26:07,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:07,168 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-16 19:26:07,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:26:07,168 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:26:07,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash -328959756, now seen corresponding path program 1 times [2025-03-16 19:26:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488368021] [2025-03-16 19:26:07,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:07,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:26:07,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:26:07,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:07,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:07,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:07,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488368021] [2025-03-16 19:26:07,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488368021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:07,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:07,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:26:07,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206728633] [2025-03-16 19:26:07,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:07,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:26:07,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:07,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:26:07,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:26:07,395 INFO L87 Difference]: Start difference. First operand 33994 states and 45753 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:08,576 INFO L93 Difference]: Finished difference Result 101228 states and 135389 transitions. [2025-03-16 19:26:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 19:26:08,576 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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-16 19:26:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:08,680 INFO L225 Difference]: With dead ends: 101228 [2025-03-16 19:26:08,680 INFO L226 Difference]: Without dead ends: 86004 [2025-03-16 19:26:08,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:26:08,713 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 2048 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2048 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:08,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2048 Valid, 2342 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:26:08,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86004 states. [2025-03-16 19:26:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86004 to 37142. [2025-03-16 19:26:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37142 states, 37141 states have (on average 1.3464904014431491) internal successors, (50010), 37141 states have internal predecessors, (50010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37142 states to 37142 states and 50010 transitions. [2025-03-16 19:26:09,385 INFO L78 Accepts]: Start accepts. Automaton has 37142 states and 50010 transitions. Word has length 89 [2025-03-16 19:26:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:09,385 INFO L471 AbstractCegarLoop]: Abstraction has 37142 states and 50010 transitions. [2025-03-16 19:26:09,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 37142 states and 50010 transitions. [2025-03-16 19:26:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:26:09,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:09,392 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-16 19:26:09,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:26:09,392 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-16 19:26:09,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash -65765665, now seen corresponding path program 1 times [2025-03-16 19:26:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:09,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430013283] [2025-03-16 19:26:09,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:09,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:26:09,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:26:09,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:09,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:09,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430013283] [2025-03-16 19:26:09,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430013283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:09,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:09,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:26:09,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951469150] [2025-03-16 19:26:09,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:09,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:26:09,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:09,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:26:09,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:09,630 INFO L87 Difference]: Start difference. First operand 37142 states and 50010 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:10,591 INFO L93 Difference]: Finished difference Result 90546 states and 120969 transitions. [2025-03-16 19:26:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:26:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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-16 19:26:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:10,664 INFO L225 Difference]: With dead ends: 90546 [2025-03-16 19:26:10,664 INFO L226 Difference]: Without dead ends: 72232 [2025-03-16 19:26:10,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:26:10,681 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1687 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:10,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 1952 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:26:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72232 states. [2025-03-16 19:26:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72232 to 61935. [2025-03-16 19:26:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61935 states, 61934 states have (on average 1.3388930151451546) internal successors, (82923), 61934 states have internal predecessors, (82923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61935 states to 61935 states and 82923 transitions. [2025-03-16 19:26:11,266 INFO L78 Accepts]: Start accepts. Automaton has 61935 states and 82923 transitions. Word has length 89 [2025-03-16 19:26:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:11,266 INFO L471 AbstractCegarLoop]: Abstraction has 61935 states and 82923 transitions. [2025-03-16 19:26:11,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 61935 states and 82923 transitions. [2025-03-16 19:26:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:26:11,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:11,274 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-16 19:26:11,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:26:11,274 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-16 19:26:11,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:11,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2089298550, now seen corresponding path program 1 times [2025-03-16 19:26:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:11,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486214518] [2025-03-16 19:26:11,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:11,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:26:11,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:26:11,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:11,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:11,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486214518] [2025-03-16 19:26:11,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486214518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:26:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242641383] [2025-03-16 19:26:11,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:11,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:26:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:26:11,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:26:11,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:26:11,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:26:11,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:26:11,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:11,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:11,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:26:11,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:26:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:12,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:26:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:13,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242641383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:26:13,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:26:13,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 27 [2025-03-16 19:26:13,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719154673] [2025-03-16 19:26:13,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:26:13,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 19:26:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:13,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 19:26:13,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:26:13,065 INFO L87 Difference]: Start difference. First operand 61935 states and 82923 transitions. Second operand has 28 states, 28 states have (on average 8.214285714285714) internal successors, (230), 27 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:22,530 INFO L93 Difference]: Finished difference Result 374466 states and 493263 transitions. [2025-03-16 19:26:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2025-03-16 19:26:22,531 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.214285714285714) internal successors, (230), 27 states have internal predecessors, (230), 0 states have call successors, (0), 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-16 19:26:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:23,032 INFO L225 Difference]: With dead ends: 374466 [2025-03-16 19:26:23,032 INFO L226 Difference]: Without dead ends: 359248 [2025-03-16 19:26:23,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13046 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5739, Invalid=30171, Unknown=0, NotChecked=0, Total=35910 [2025-03-16 19:26:23,140 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 7039 mSDsluCounter, 7043 mSDsCounter, 0 mSdLazyCounter, 8463 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7039 SdHoareTripleChecker+Valid, 7622 SdHoareTripleChecker+Invalid, 8618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 8463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:23,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7039 Valid, 7622 Invalid, 8618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 8463 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-16 19:26:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359248 states. [2025-03-16 19:26:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359248 to 62441. [2025-03-16 19:26:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62441 states, 62440 states have (on average 1.33888532991672) internal successors, (83600), 62440 states have internal predecessors, (83600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62441 states to 62441 states and 83600 transitions. [2025-03-16 19:26:25,569 INFO L78 Accepts]: Start accepts. Automaton has 62441 states and 83600 transitions. Word has length 89 [2025-03-16 19:26:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:25,569 INFO L471 AbstractCegarLoop]: Abstraction has 62441 states and 83600 transitions. [2025-03-16 19:26:25,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.214285714285714) internal successors, (230), 27 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 62441 states and 83600 transitions. [2025-03-16 19:26:25,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:26:25,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:25,576 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-16 19:26:25,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:26:25,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-16 19:26:25,777 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-16 19:26:25,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1817719457, now seen corresponding path program 1 times [2025-03-16 19:26:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:25,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757880875] [2025-03-16 19:26:25,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:25,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:26:25,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:26:25,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:25,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:25,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:25,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757880875] [2025-03-16 19:26:25,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757880875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:26:25,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983446196] [2025-03-16 19:26:25,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:25,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:26:25,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:26:25,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:26:25,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:26:26,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:26:26,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:26:26,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:26,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:26,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 19:26:26,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:26:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:26,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:26:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:26,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983446196] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:26:26,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:26:26,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 15 [2025-03-16 19:26:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060941822] [2025-03-16 19:26:26,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:26:26,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 19:26:26,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:26,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 19:26:26,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:26:26,566 INFO L87 Difference]: Start difference. First operand 62441 states and 83600 transitions. Second operand has 15 states, 15 states have (on average 13.8) internal successors, (207), 15 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:28,244 INFO L93 Difference]: Finished difference Result 475229 states and 641306 transitions. [2025-03-16 19:26:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-16 19:26:28,245 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.8) internal successors, (207), 15 states have internal predecessors, (207), 0 states have call successors, (0), 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-16 19:26:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:29,276 INFO L225 Difference]: With dead ends: 475229 [2025-03-16 19:26:29,276 INFO L226 Difference]: Without dead ends: 414408 [2025-03-16 19:26:29,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 19:26:29,369 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 4793 mSDsluCounter, 3628 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4793 SdHoareTripleChecker+Valid, 4579 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:29,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4793 Valid, 4579 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:26:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414408 states. [2025-03-16 19:26:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414408 to 374930. [2025-03-16 19:26:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374930 states, 374929 states have (on average 1.3305319140423921) internal successors, (498855), 374929 states have internal predecessors, (498855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374930 states to 374930 states and 498855 transitions. [2025-03-16 19:26:34,845 INFO L78 Accepts]: Start accepts. Automaton has 374930 states and 498855 transitions. Word has length 89 [2025-03-16 19:26:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:34,846 INFO L471 AbstractCegarLoop]: Abstraction has 374930 states and 498855 transitions. [2025-03-16 19:26:34,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.8) internal successors, (207), 15 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 374930 states and 498855 transitions. [2025-03-16 19:26:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:26:34,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:34,854 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-16 19:26:34,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 19:26:35,059 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-16 19:26:35,059 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-16 19:26:35,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1731856533, now seen corresponding path program 1 times [2025-03-16 19:26:35,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:35,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936518949] [2025-03-16 19:26:35,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:35,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:35,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:26:35,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:26:35,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:35,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:35,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936518949] [2025-03-16 19:26:35,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936518949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:35,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:35,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:35,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060335602] [2025-03-16 19:26:35,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:35,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:35,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:35,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:35,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:35,094 INFO L87 Difference]: Start difference. First operand 374930 states and 498855 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-16 19:26:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:38,269 INFO L93 Difference]: Finished difference Result 895517 states and 1192155 transitions. [2025-03-16 19:26:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:38,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-16 19:26:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:39,252 INFO L225 Difference]: With dead ends: 895517 [2025-03-16 19:26:39,252 INFO L226 Difference]: Without dead ends: 619815 [2025-03-16 19:26:39,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:39,373 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 187 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:39,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1039 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619815 states. [2025-03-16 19:26:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619815 to 398274. [2025-03-16 19:26:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398274 states, 398273 states have (on average 1.3279308414077782) internal successors, (528879), 398273 states have internal predecessors, (528879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398274 states to 398274 states and 528879 transitions. [2025-03-16 19:26:46,373 INFO L78 Accepts]: Start accepts. Automaton has 398274 states and 528879 transitions. Word has length 92 [2025-03-16 19:26:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:46,374 INFO L471 AbstractCegarLoop]: Abstraction has 398274 states and 528879 transitions. [2025-03-16 19:26:46,374 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-16 19:26:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 398274 states and 528879 transitions. [2025-03-16 19:26:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:26:46,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:46,386 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-16 19:26:46,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:26:46,386 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-16 19:26:46,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash 767993248, now seen corresponding path program 1 times [2025-03-16 19:26:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:46,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364871757] [2025-03-16 19:26:46,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:46,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:46,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:26:46,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:26:46,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:46,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:46,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:46,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364871757] [2025-03-16 19:26:46,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364871757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:46,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:46,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:26:46,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396777514] [2025-03-16 19:26:46,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:46,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:46,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:46,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:46,479 INFO L87 Difference]: Start difference. First operand 398274 states and 528879 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)