./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-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 f1b965f33911949d5293afac2c8bd242d07bfd4e9981eefc7864b2608138df3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:26:22,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:26:22,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:26:22,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:26:22,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:26:22,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:26:22,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:26:22,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:26:22,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:26:22,804 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:26:22,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:26:22,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:26:22,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:26:22,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:26:22,805 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:26:22,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:26:22,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:26:22,806 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:26:22,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:26:22,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:26:22,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:26:22,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:26:22,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:26:22,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:26:22,806 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:26:22,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:26:22,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:26:22,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:26:22,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:26:22,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:26:22,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:26:22,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:26:22,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:26:22,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:26:22,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:26:22,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:26:22,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:26:22,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:26:22,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:26:22,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:26:22,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:26:22,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:26:22,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:26:22,808 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 -> f1b965f33911949d5293afac2c8bd242d07bfd4e9981eefc7864b2608138df3f [2025-03-16 19:26:23,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:26:23,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:26:23,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:26:23,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:26:23,040 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:26:23,041 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-16 19:26:24,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc72989/15ddb068c62b4ec4bcdc92054af29a1b/FLAG740da3e0f [2025-03-16 19:26:24,548 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:26:24,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-16 19:26:24,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc72989/15ddb068c62b4ec4bcdc92054af29a1b/FLAG740da3e0f [2025-03-16 19:26:24,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc72989/15ddb068c62b4ec4bcdc92054af29a1b [2025-03-16 19:26:24,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:26:24,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:26:24,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:26:24,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:26:24,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:26:24,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:26:24" (1/1) ... [2025-03-16 19:26:24,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110580f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:24, skipping insertion in model container [2025-03-16 19:26:24,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:26:24" (1/1) ... [2025-03-16 19:26:24,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:26:25,060 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11900,11913] [2025-03-16 19:26:25,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18638,18651] [2025-03-16 19:26:25,094 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20836,20849] [2025-03-16 19:26:25,098 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21913,21926] [2025-03-16 19:26:25,106 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25266,25279] [2025-03-16 19:26:25,109 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26346,26359] [2025-03-16 19:26:25,119 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28575,28588] [2025-03-16 19:26:25,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:26:25,354 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:26:25,399 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11900,11913] [2025-03-16 19:26:25,408 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18638,18651] [2025-03-16 19:26:25,443 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20836,20849] [2025-03-16 19:26:25,445 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21913,21926] [2025-03-16 19:26:25,449 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25266,25279] [2025-03-16 19:26:25,451 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26346,26359] [2025-03-16 19:26:25,454 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28575,28588] [2025-03-16 19:26:25,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:26:25,599 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:26:25,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25 WrapperNode [2025-03-16 19:26:25,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:26:25,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:26:25,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:26:25,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:26:25,606 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:26:25" (1/1) ... [2025-03-16 19:26:25,638 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:26:25" (1/1) ... [2025-03-16 19:26:25,762 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7046 [2025-03-16 19:26:25,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:26:25,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:26:25,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:26:25,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:26:25,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25" (1/1) ... [2025-03-16 19:26:25,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25" (1/1) ... [2025-03-16 19:26:25,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25" (1/1) ... [2025-03-16 19:26:25,834 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:26:25,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25" (1/1) ... [2025-03-16 19:26:25,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25" (1/1) ... [2025-03-16 19:26:25,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25" (1/1) ... [2025-03-16 19:26:25,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25" (1/1) ... [2025-03-16 19:26:25,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25" (1/1) ... [2025-03-16 19:26:25,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25" (1/1) ... [2025-03-16 19:26:25,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:26:25,936 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:26:25,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:26:25,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:26:25,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25" (1/1) ... [2025-03-16 19:26:25,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:26:25,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:26:25,962 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:26:25,965 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:26:25,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:26:25,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:26:25,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:26:25,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:26:26,221 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:26:26,223 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:26:28,709 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4462: havoc main_~node4__m4~18#1; [2025-03-16 19:26:28,709 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10672: havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~149#1; [2025-03-16 19:26:28,709 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8955: havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~122#1;havoc main_~node4____CPAchecker_TMP_1~27#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4992: havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~60#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4200: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10543: havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~147#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10015: havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~139#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8562: havoc main_~node4__m4~34#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10148: havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~141#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3938: havoc main_~node4__m4~16#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9092: havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~124#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5261: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8300: havoc main_~node3__m3~11#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7772: havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9358: havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~128#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11077: havoc main_~node4__m4~44#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6586: havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~85#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4472: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397: havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~66#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7908: havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~106#1;havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5530: havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~68#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6191: havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~79#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~node4__m4~0#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4210: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6457: havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~83#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8572: havoc main_~node4____CPAchecker_TMP_0~26#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4608: havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~54#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-16 19:26:28,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7515: havoc main_~node4__m4~30#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3948: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3024: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8045: havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~108#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8310: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7253: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L779: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~33#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8708: havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~118#1;havoc main_~node4____CPAchecker_TMP_1~26#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4084: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~46#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6991: havoc main_~node4__m4~28#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1838: havoc main_~check__tmp~13#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11087: havoc main_~node4____CPAchecker_TMP_0~36#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4745: havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~56#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9768: havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~135#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10429: havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~145#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4219: havoc main_~node4__m4~17#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9901: havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~137#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3691: havoc main_~node4__m4~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11223: havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~158#1;havoc main_~node4____CPAchecker_TMP_1~36#1; [2025-03-16 19:26:28,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8845: havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~120#1; [2025-03-16 19:26:28,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7525: havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-03-16 19:26:28,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8319: havoc main_~node4__m4~33#1; [2025-03-16 19:26:28,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1052: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:26:28,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10830: havoc main_~node4__m4~43#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7263: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7661: havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~102#1;havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1319: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5944: havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~75#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7001: havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6077: havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~77#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6343: havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~81#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4229: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2644: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3701: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L530: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:26:28,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1455: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5287: havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~64#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7137: havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~94#1;havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7798: havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~104#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1721: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4365: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~50#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1194: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7272: havoc main_~node4__m4~29#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8329: havoc main_~node4____CPAchecker_TMP_0~25#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3837: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~42#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6744: havoc main_~node4__m4~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10840: havoc main_~node4____CPAchecker_TMP_0~35#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4498: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~52#1; [2025-03-16 19:26:28,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5159: havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~63#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3444: havoc main_~node4__m4~14#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9654: havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~133#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8465: havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~114#1;havoc main_~node4____CPAchecker_TMP_1~25#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10976: havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~154#1;havoc main_~node4____CPAchecker_TMP_1~35#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8598: havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~116#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9259: havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~127#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3974: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~44#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3182: havoc main_~node3__m3~6#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9525: havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~131#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10583: havoc main_~node4__m4~42#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L807: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11113: havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~156#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7282: havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10321: havoc main_~node3__m3~13#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-16 19:26:28,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6754: havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5697: havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~71#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830: havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~73#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1602: havoc main_~node2__m2~3#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10059: havoc main_~node4__m4~40#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3454: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7418: havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~98#1;havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6890: havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~90#1;havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2530: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7551: havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~100#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8212: havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~111#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3192: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3590: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~38#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2401: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6497: havoc main_~node4__m4~26#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10593: havoc main_~node4____CPAchecker_TMP_0~34#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4912: havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~59#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7027: havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~92#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5045: havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~61#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc main_~node2__m2~2#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10331: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6235: havoc main_~node3__m3~9#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10729: havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~150#1;havoc main_~node4____CPAchecker_TMP_1~34#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4255: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~48#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10069: havoc main_~node4____CPAchecker_TMP_0~32#1; [2025-03-16 19:26:28,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9012: havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~123#1; [2025-03-16 19:26:28,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3727: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~40#1; [2025-03-16 19:26:28,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2935: havoc main_~node4__m4~12#1; [2025-03-16 19:26:28,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9145: havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~125#1; [2025-03-16 19:26:28,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L426: 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:26:28,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9411: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~129#1; [2025-03-16 19:26:28,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: havoc main_~node4__m4~13#1; [2025-03-16 19:26:28,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8355: havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~112#1; [2025-03-16 19:26:28,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10205: havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~142#1;havoc main_~node4____CPAchecker_TMP_1~32#1; [2025-03-16 19:26:28,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2013: havoc main_~check__tmp~15#1; [2025-03-16 19:26:28,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10866: havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~152#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L957: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L693: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6507: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1619: havoc main_~node3__m3~4#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5583: havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~69#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1487: havoc main_~check__tmp~9#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10340: havoc main_~node4__m4~41#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9812: havoc main_~node4__m4~39#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6245: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6643: havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~86#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5454: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~67#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7965: havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~107#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8098: havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~109#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2945: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-16 19:26:28,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~55#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7308: havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~96#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4798: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~57#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6780: havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~88#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5988: havoc main_~node4__m4~24#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node3__m3~2#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3347: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~34#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6254: havoc main_~node4__m4~25#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10350: havoc main_~node4____CPAchecker_TMP_0~33#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8765: havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~119#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9822: havoc main_~node4____CPAchecker_TMP_0~31#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3480: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~36#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4141: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~47#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8898: havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~121#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688: havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10486: havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~146#1;havoc main_~node4____CPAchecker_TMP_1~33#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9958: havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~138#1;havoc main_~node4____CPAchecker_TMP_1~31#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10619: havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~148#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1370: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11280: havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~159#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636: havoc main_~node4__m4~6#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9565: havoc main_~node4__m4~38#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1109: havoc main_~node4__m4~3#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5998: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: havoc main_~node4__m4~7#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10095: havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~140#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc main_~node2__m2~1#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6264: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9303: havoc main_~node3__m3~12#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7718: havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~103#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L319: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:26:28,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5340: havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~65#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7851: havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~105#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2698: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6134: havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~78#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6400: havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~82#1;havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4551: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~53#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6533: havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~84#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7194: havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~95#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5212: havoc main_~node2__m2~4#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2834: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5741: havoc main_~node4__m4~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L985: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:28,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L721: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L589: havoc main_~node4__m4~2#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4422: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~51#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9575: havoc main_~node4____CPAchecker_TMP_0~30#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3894: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~43#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8651: havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~117#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2441: havoc main_~node4__m4~10#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4027: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~45#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9313: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2971: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L329: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8522: havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~115#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9711: havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~134#1;havoc main_~node4____CPAchecker_TMP_1~30#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3237: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~32#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11033: havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~155#1; [2025-03-16 19:26:28,721 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11166: havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~157#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4956: havoc main_~node4__m4~20#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5222: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5751: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10376: havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~144#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9848: havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~136#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L467: havoc main_~node3__m3~1#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9056: havoc main_~node4__m4~36#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L865: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7604: havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~101#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9322: havoc main_~node4__m4~37#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5887: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~74#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L339: havoc main_~node2__m2~0#1; [2025-03-16 19:26:28,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475: havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~99#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~91#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2587: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5494: havoc main_~node4__m4~22#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4966: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7080: havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~93#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: havoc main_~node3__m3~5#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6024: havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~76#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1268: havoc main_~node3__m3~3#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5232: havoc main_~node3__m3~8#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3647: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~39#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6290: havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~80#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4308: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~49#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3780: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~41#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5102: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~62#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9066: havoc main_~node4____CPAchecker_TMP_0~28#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8009: havoc main_~node4__m4~32#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9332: havoc main_~node4____CPAchecker_TMP_0~29#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10786: havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~151#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8408: havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~113#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1670: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4709: havoc main_~node4__m4~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10919: havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~153#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9202: havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~126#1;havoc main_~node4____CPAchecker_TMP_1~28#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1143: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9468: havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~130#1;havoc main_~node4____CPAchecker_TMP_1~29#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5504: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L484: havoc main_~node4__m4~1#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9601: havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~132#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8280: havoc main_~node2__m2~5#1;havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10262: havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~143#1; [2025-03-16 19:26:28,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8809: havoc main_~node4__m4~35#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5242: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5640: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~70#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8019: havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6700: havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~87#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7361: havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~97#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4719: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6833: havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~89#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: havoc main_~node3__m3~0#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8155: havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~110#1;havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1945: havoc main_~node4__m4~8#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5777: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~72#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1285: havoc main_~node4__m4~4#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3533: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~37#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1419: havoc main_~node4__m4~5#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2344: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5251: havoc main_~node4__m4~21#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8290: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-16 19:26:28,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4855: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~58#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-16 19:26:28,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8819: havoc main_~node4____CPAchecker_TMP_0~27#1; [2025-03-16 19:26:28,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7762: havoc main_~node4__m4~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-16 19:26:28,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2477: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-03-16 19:26:28,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3138: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-03-16 19:26:28,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:26:28,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L893: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:28,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3404: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~35#1; [2025-03-16 19:26:28,932 INFO L? ?]: Removed 1112 outVars from TransFormulas that were not future-live. [2025-03-16 19:26:28,933 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:26:28,966 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:26:28,966 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:26:28,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:26:28 BoogieIcfgContainer [2025-03-16 19:26:28,966 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:26:28,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:26:28,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:26:28,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:26:28,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:26:24" (1/3) ... [2025-03-16 19:26:28,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a6a211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:26:28, skipping insertion in model container [2025-03-16 19:26:28,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:25" (2/3) ... [2025-03-16 19:26:28,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a6a211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:26:28, skipping insertion in model container [2025-03-16 19:26:28,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:26:28" (3/3) ... [2025-03-16 19:26:28,975 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-16 19:26:28,985 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:26:28,989 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 1101 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-16 19:26:29,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:26:29,061 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;@401e536b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:26:29,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-16 19:26:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 1101 states, 1093 states have (on average 1.888380603842635) internal successors, (2064), 1100 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states 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:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:26:29,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:29,081 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:26:29,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:29,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash 189662108, now seen corresponding path program 1 times [2025-03-16 19:26:29,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:29,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034951505] [2025-03-16 19:26:29,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:29,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:29,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:26:29,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:26:29,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:29,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:29,514 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:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034951505] [2025-03-16 19:26:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034951505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:29,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:29,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972888217] [2025-03-16 19:26:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:29,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:29,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:29,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:29,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:29,539 INFO L87 Difference]: Start difference. First operand has 1101 states, 1093 states have (on average 1.888380603842635) internal successors, (2064), 1100 states have internal predecessors, (2064), 0 states have call successors, (0), 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 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:26:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:29,741 INFO L93 Difference]: Finished difference Result 1454 states and 2639 transitions. [2025-03-16 19:26:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:29,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:26:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:29,758 INFO L225 Difference]: With dead ends: 1454 [2025-03-16 19:26:29,758 INFO L226 Difference]: Without dead ends: 1280 [2025-03-16 19:26:29,761 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:29,763 INFO L435 NwaCegarLoop]: 2049 mSDtfsCounter, 966 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 3319 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:29,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 3319 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:26:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-03-16 19:26:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1272. [2025-03-16 19:26:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1265 states have (on average 1.3201581027667983) internal successors, (1670), 1271 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states 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:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1670 transitions. [2025-03-16 19:26:29,845 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1670 transitions. Word has length 62 [2025-03-16 19:26:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:29,845 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1670 transitions. [2025-03-16 19:26:29,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:26:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1670 transitions. [2025-03-16 19:26:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:26:29,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:29,851 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:26:29,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:26:29,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:29,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash -915539844, now seen corresponding path program 1 times [2025-03-16 19:26:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:29,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519261832] [2025-03-16 19:26:29,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:29,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:26:29,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:26:29,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:29,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:30,147 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:30,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:30,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519261832] [2025-03-16 19:26:30,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519261832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:30,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:30,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:30,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393868187] [2025-03-16 19:26:30,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:30,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:30,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:30,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:30,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:30,149 INFO L87 Difference]: Start difference. First operand 1272 states and 1670 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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:26:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:30,652 INFO L93 Difference]: Finished difference Result 2246 states and 3046 transitions. [2025-03-16 19:26:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:30,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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:26:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:30,659 INFO L225 Difference]: With dead ends: 2246 [2025-03-16 19:26:30,660 INFO L226 Difference]: Without dead ends: 1281 [2025-03-16 19:26:30,662 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:26:30,664 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 3659 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3659 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:30,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3659 Valid, 829 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:26:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2025-03-16 19:26:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1273. [2025-03-16 19:26:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1266 states have (on average 1.3751974723538705) internal successors, (1741), 1272 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states 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:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1741 transitions. [2025-03-16 19:26:30,702 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1741 transitions. Word has length 62 [2025-03-16 19:26:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:30,702 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1741 transitions. [2025-03-16 19:26:30,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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:26:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1741 transitions. [2025-03-16 19:26:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:26:30,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:30,704 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:26:30,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:26:30,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:30,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:30,705 INFO L85 PathProgramCache]: Analyzing trace with hash 983767507, now seen corresponding path program 1 times [2025-03-16 19:26:30,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:30,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831374099] [2025-03-16 19:26:30,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:30,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:30,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:26:30,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:26:30,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:30,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:31,014 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:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831374099] [2025-03-16 19:26:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831374099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:31,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:31,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:31,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549113048] [2025-03-16 19:26:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:31,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:31,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:31,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:31,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:31,016 INFO L87 Difference]: Start difference. First operand 1273 states and 1741 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:26:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:31,469 INFO L93 Difference]: Finished difference Result 2259 states and 3149 transitions. [2025-03-16 19:26:31,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:31,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:26:31,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:31,474 INFO L225 Difference]: With dead ends: 2259 [2025-03-16 19:26:31,475 INFO L226 Difference]: Without dead ends: 1399 [2025-03-16 19:26:31,476 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:26:31,477 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 3055 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3055 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:31,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3055 Valid, 690 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:26:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-03-16 19:26:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1389. [2025-03-16 19:26:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1382 states have (on average 1.369753979739508) internal successors, (1893), 1388 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states 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:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1893 transitions. [2025-03-16 19:26:31,501 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1893 transitions. Word has length 63 [2025-03-16 19:26:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:31,501 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1893 transitions. [2025-03-16 19:26:31,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:26:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1893 transitions. [2025-03-16 19:26:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:26:31,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:31,503 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:26:31,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:26:31,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:31,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1836340339, now seen corresponding path program 1 times [2025-03-16 19:26:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775992009] [2025-03-16 19:26:31,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:31,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:31,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:26:31,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:26:31,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:31,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:31,661 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:31,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:31,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775992009] [2025-03-16 19:26:31,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775992009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:31,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:31,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:31,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146019303] [2025-03-16 19:26:31,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:31,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:31,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:31,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:31,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:31,662 INFO L87 Difference]: Start difference. First operand 1389 states and 1893 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:26:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:32,011 INFO L93 Difference]: Finished difference Result 3068 states and 4331 transitions. [2025-03-16 19:26:32,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:32,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:26:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:32,019 INFO L225 Difference]: With dead ends: 3068 [2025-03-16 19:26:32,019 INFO L226 Difference]: Without dead ends: 1882 [2025-03-16 19:26:32,021 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:26:32,023 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 2720 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2720 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:32,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2720 Valid, 641 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:26:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2025-03-16 19:26:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1874. [2025-03-16 19:26:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1867 states have (on average 1.4220674879485806) internal successors, (2655), 1873 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states 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:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2655 transitions. [2025-03-16 19:26:32,056 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2655 transitions. Word has length 63 [2025-03-16 19:26:32,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:32,057 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 2655 transitions. [2025-03-16 19:26:32,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:26:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2655 transitions. [2025-03-16 19:26:32,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:26:32,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:32,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] [2025-03-16 19:26:32,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:26:32,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:32,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:32,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1498368180, now seen corresponding path program 1 times [2025-03-16 19:26:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:32,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675939139] [2025-03-16 19:26:32,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:32,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:32,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:26:32,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:26:32,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:32,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:32,137 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:32,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:32,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675939139] [2025-03-16 19:26:32,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675939139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:32,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:32,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:32,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584321215] [2025-03-16 19:26:32,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:32,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:32,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:32,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:32,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:32,139 INFO L87 Difference]: Start difference. First operand 1874 states and 2655 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:32,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:32,181 INFO L93 Difference]: Finished difference Result 3901 states and 5617 transitions. [2025-03-16 19:26:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:32,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:26:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:32,189 INFO L225 Difference]: With dead ends: 3901 [2025-03-16 19:26:32,189 INFO L226 Difference]: Without dead ends: 2611 [2025-03-16 19:26:32,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:32,191 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 584 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:32,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1524 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2025-03-16 19:26:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2597. [2025-03-16 19:26:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2590 states have (on average 1.4065637065637067) internal successors, (3643), 2596 states have internal predecessors, (3643), 0 states have call successors, (0), 0 states 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:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 3643 transitions. [2025-03-16 19:26:32,234 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 3643 transitions. Word has length 64 [2025-03-16 19:26:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:32,234 INFO L471 AbstractCegarLoop]: Abstraction has 2597 states and 3643 transitions. [2025-03-16 19:26:32,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3643 transitions. [2025-03-16 19:26:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:26:32,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:32,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:32,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:26:32,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:32,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:32,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1064041152, now seen corresponding path program 1 times [2025-03-16 19:26:32,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:32,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726825844] [2025-03-16 19:26:32,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:32,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:32,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:26:32,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:26:32,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:32,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:32,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:32,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726825844] [2025-03-16 19:26:32,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726825844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:32,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:32,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:32,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592950201] [2025-03-16 19:26:32,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:32,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:32,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:32,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:32,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:32,324 INFO L87 Difference]: Start difference. First operand 2597 states and 3643 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:32,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:32,369 INFO L93 Difference]: Finished difference Result 6514 states and 9298 transitions. [2025-03-16 19:26:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:32,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:26:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:32,383 INFO L225 Difference]: With dead ends: 6514 [2025-03-16 19:26:32,383 INFO L226 Difference]: Without dead ends: 4448 [2025-03-16 19:26:32,386 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:32,388 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 593 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:32,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1533 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2025-03-16 19:26:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4431. [2025-03-16 19:26:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4431 states, 4424 states have (on average 1.405741410488246) internal successors, (6219), 4430 states have internal predecessors, (6219), 0 states have call successors, (0), 0 states 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:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 6219 transitions. [2025-03-16 19:26:32,481 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 6219 transitions. Word has length 64 [2025-03-16 19:26:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:32,481 INFO L471 AbstractCegarLoop]: Abstraction has 4431 states and 6219 transitions. [2025-03-16 19:26:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 6219 transitions. [2025-03-16 19:26:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:26:32,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:32,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:26:32,485 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:32,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:32,485 INFO L85 PathProgramCache]: Analyzing trace with hash 797788660, now seen corresponding path program 1 times [2025-03-16 19:26:32,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:32,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266291273] [2025-03-16 19:26:32,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:32,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:32,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:26:32,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:26:32,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:32,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:32,611 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:32,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:32,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266291273] [2025-03-16 19:26:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266291273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:32,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:26:32,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42452265] [2025-03-16 19:26:32,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:32,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:32,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:32,612 INFO L87 Difference]: Start difference. First operand 4431 states and 6219 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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:26:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:32,949 INFO L93 Difference]: Finished difference Result 11070 states and 15833 transitions. [2025-03-16 19:26:32,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:32,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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:26:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:32,970 INFO L225 Difference]: With dead ends: 11070 [2025-03-16 19:26:32,971 INFO L226 Difference]: Without dead ends: 7074 [2025-03-16 19:26:32,977 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:26:32,978 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 2406 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:32,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 579 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:26:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7074 states. [2025-03-16 19:26:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7074 to 7066. [2025-03-16 19:26:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7066 states, 7059 states have (on average 1.4215894602634933) internal successors, (10035), 7065 states have internal predecessors, (10035), 0 states have call successors, (0), 0 states 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:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7066 states to 7066 states and 10035 transitions. [2025-03-16 19:26:33,210 INFO L78 Accepts]: Start accepts. Automaton has 7066 states and 10035 transitions. Word has length 65 [2025-03-16 19:26:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:33,210 INFO L471 AbstractCegarLoop]: Abstraction has 7066 states and 10035 transitions. [2025-03-16 19:26:33,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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:26:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 7066 states and 10035 transitions. [2025-03-16 19:26:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:26:33,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:33,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:33,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:26:33,215 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:33,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:33,216 INFO L85 PathProgramCache]: Analyzing trace with hash -643132429, now seen corresponding path program 1 times [2025-03-16 19:26:33,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:33,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896186117] [2025-03-16 19:26:33,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:33,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:26:33,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:26:33,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:33,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:33,282 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:33,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896186117] [2025-03-16 19:26:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896186117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:33,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:33,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27874091] [2025-03-16 19:26:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:33,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:33,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:33,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:33,284 INFO L87 Difference]: Start difference. First operand 7066 states and 10035 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:26:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:33,355 INFO L93 Difference]: Finished difference Result 15208 states and 21842 transitions. [2025-03-16 19:26:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:33,355 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:26:33,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:33,382 INFO L225 Difference]: With dead ends: 15208 [2025-03-16 19:26:33,382 INFO L226 Difference]: Without dead ends: 9562 [2025-03-16 19:26:33,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:33,391 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 400 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:33,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1180 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9562 states. [2025-03-16 19:26:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9562 to 9518. [2025-03-16 19:26:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9518 states, 9511 states have (on average 1.4032173273052255) internal successors, (13346), 9517 states have internal predecessors, (13346), 0 states have call successors, (0), 0 states 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:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9518 states to 9518 states and 13346 transitions. [2025-03-16 19:26:33,562 INFO L78 Accepts]: Start accepts. Automaton has 9518 states and 13346 transitions. Word has length 65 [2025-03-16 19:26:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:33,562 INFO L471 AbstractCegarLoop]: Abstraction has 9518 states and 13346 transitions. [2025-03-16 19:26:33,562 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:26:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 9518 states and 13346 transitions. [2025-03-16 19:26:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:26:33,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:33,568 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:26:33,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:26:33,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:33,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash -629680900, now seen corresponding path program 1 times [2025-03-16 19:26:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:33,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283553945] [2025-03-16 19:26:33,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:33,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:33,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:26:33,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:26:33,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:33,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:33,705 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:33,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:33,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283553945] [2025-03-16 19:26:33,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283553945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:33,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:33,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384568636] [2025-03-16 19:26:33,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:33,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:33,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:33,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:33,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:33,707 INFO L87 Difference]: Start difference. First operand 9518 states and 13346 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:34,279 INFO L93 Difference]: Finished difference Result 26692 states and 38020 transitions. [2025-03-16 19:26:34,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:34,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:34,322 INFO L225 Difference]: With dead ends: 26692 [2025-03-16 19:26:34,323 INFO L226 Difference]: Without dead ends: 23149 [2025-03-16 19:26:34,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:34,335 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 3212 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3212 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:34,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3212 Valid, 1115 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:26:34,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23149 states. [2025-03-16 19:26:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23149 to 9586. [2025-03-16 19:26:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9586 states, 9579 states have (on average 1.4024428437206389) internal successors, (13434), 9585 states have internal predecessors, (13434), 0 states have call successors, (0), 0 states 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,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9586 states to 9586 states and 13434 transitions. [2025-03-16 19:26:34,637 INFO L78 Accepts]: Start accepts. Automaton has 9586 states and 13434 transitions. Word has length 66 [2025-03-16 19:26:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:34,637 INFO L471 AbstractCegarLoop]: Abstraction has 9586 states and 13434 transitions. [2025-03-16 19:26:34,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 9586 states and 13434 transitions. [2025-03-16 19:26:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:26:34,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:34,649 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:26:34,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:26:34,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:34,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash 321567532, now seen corresponding path program 1 times [2025-03-16 19:26:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:34,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401824214] [2025-03-16 19:26:34,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:34,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:34,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:26:34,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:26:34,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:34,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:34,854 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:34,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:34,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401824214] [2025-03-16 19:26:34,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401824214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:34,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:34,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:34,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621354498] [2025-03-16 19:26:34,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:34,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:34,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:34,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:34,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:34,856 INFO L87 Difference]: Start difference. First operand 9586 states and 13434 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:35,429 INFO L93 Difference]: Finished difference Result 25329 states and 36054 transitions. [2025-03-16 19:26:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:35,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:35,467 INFO L225 Difference]: With dead ends: 25329 [2025-03-16 19:26:35,467 INFO L226 Difference]: Without dead ends: 20831 [2025-03-16 19:26:35,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:35,477 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 3116 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3116 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:35,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3116 Valid, 1097 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:26:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20831 states. [2025-03-16 19:26:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20831 to 9742. [2025-03-16 19:26:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9742 states, 9735 states have (on average 1.4011299435028248) internal successors, (13640), 9741 states have internal predecessors, (13640), 0 states have call successors, (0), 0 states 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:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9742 states to 9742 states and 13640 transitions. [2025-03-16 19:26:35,704 INFO L78 Accepts]: Start accepts. Automaton has 9742 states and 13640 transitions. Word has length 66 [2025-03-16 19:26:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:35,705 INFO L471 AbstractCegarLoop]: Abstraction has 9742 states and 13640 transitions. [2025-03-16 19:26:35,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 9742 states and 13640 transitions. [2025-03-16 19:26:35,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:26:35,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:35,712 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:26:35,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:26:35,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:35,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1795958191, now seen corresponding path program 1 times [2025-03-16 19:26:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:35,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233731581] [2025-03-16 19:26:35,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:35,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:26:35,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:26:35,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:35,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:35,874 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:35,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:35,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233731581] [2025-03-16 19:26:35,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233731581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:35,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:35,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741333798] [2025-03-16 19:26:35,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:35,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:35,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:35,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:35,876 INFO L87 Difference]: Start difference. First operand 9742 states and 13640 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:36,351 INFO L93 Difference]: Finished difference Result 20477 states and 29041 transitions. [2025-03-16 19:26:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:36,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:36,373 INFO L225 Difference]: With dead ends: 20477 [2025-03-16 19:26:36,374 INFO L226 Difference]: Without dead ends: 15880 [2025-03-16 19:26:36,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:36,382 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 2868 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2868 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:36,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2868 Valid, 1053 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:26:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15880 states. [2025-03-16 19:26:36,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15880 to 9777. [2025-03-16 19:26:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9777 states, 9770 states have (on average 1.4007164790174003) internal successors, (13685), 9776 states have internal predecessors, (13685), 0 states have call successors, (0), 0 states 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:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9777 states to 9777 states and 13685 transitions. [2025-03-16 19:26:36,586 INFO L78 Accepts]: Start accepts. Automaton has 9777 states and 13685 transitions. Word has length 66 [2025-03-16 19:26:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:36,586 INFO L471 AbstractCegarLoop]: Abstraction has 9777 states and 13685 transitions. [2025-03-16 19:26:36,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 9777 states and 13685 transitions. [2025-03-16 19:26:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:26:36,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:36,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:26:36,594 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:36,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash -621253931, now seen corresponding path program 1 times [2025-03-16 19:26:36,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:36,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144201852] [2025-03-16 19:26:36,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:36,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:26:36,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:26:36,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:36,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:36,722 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:36,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:36,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144201852] [2025-03-16 19:26:36,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144201852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:36,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:36,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:36,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282916248] [2025-03-16 19:26:36,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:36,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:36,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:36,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:36,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:36,723 INFO L87 Difference]: Start difference. First operand 9777 states and 13685 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:37,256 INFO L93 Difference]: Finished difference Result 22810 states and 32395 transitions. [2025-03-16 19:26:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:37,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:37,279 INFO L225 Difference]: With dead ends: 22810 [2025-03-16 19:26:37,279 INFO L226 Difference]: Without dead ends: 18678 [2025-03-16 19:26:37,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:37,289 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 3039 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:37,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 1078 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:26:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18678 states. [2025-03-16 19:26:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18678 to 9848. [2025-03-16 19:26:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9848 states, 9841 states have (on average 1.4006706635504522) internal successors, (13784), 9847 states have internal predecessors, (13784), 0 states have call successors, (0), 0 states 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:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 13784 transitions. [2025-03-16 19:26:37,488 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 13784 transitions. Word has length 66 [2025-03-16 19:26:37,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:37,488 INFO L471 AbstractCegarLoop]: Abstraction has 9848 states and 13784 transitions. [2025-03-16 19:26:37,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 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:26:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 13784 transitions. [2025-03-16 19:26:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:26:37,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:37,494 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:26:37,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:26:37,494 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:37,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1610067476, now seen corresponding path program 1 times [2025-03-16 19:26:37,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:37,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937529599] [2025-03-16 19:26:37,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:37,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:37,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:26:37,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:26:37,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:37,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:37,914 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:37,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:37,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937529599] [2025-03-16 19:26:37,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937529599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:37,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:37,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:37,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337358785] [2025-03-16 19:26:37,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:37,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:37,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:37,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:37,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:37,916 INFO L87 Difference]: Start difference. First operand 9848 states and 13784 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) 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:26:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:38,500 INFO L93 Difference]: Finished difference Result 20932 states and 29852 transitions. [2025-03-16 19:26:38,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:26:38,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) 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:26:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:38,517 INFO L225 Difference]: With dead ends: 20932 [2025-03-16 19:26:38,517 INFO L226 Difference]: Without dead ends: 14015 [2025-03-16 19:26:38,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:38,525 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 1992 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:38,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 1547 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:26:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14015 states. [2025-03-16 19:26:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14015 to 9542. [2025-03-16 19:26:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9542 states, 9535 states have (on average 1.400209753539591) internal successors, (13351), 9541 states have internal predecessors, (13351), 0 states have call successors, (0), 0 states 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,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9542 states to 9542 states and 13351 transitions. [2025-03-16 19:26:38,675 INFO L78 Accepts]: Start accepts. Automaton has 9542 states and 13351 transitions. Word has length 67 [2025-03-16 19:26:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:38,675 INFO L471 AbstractCegarLoop]: Abstraction has 9542 states and 13351 transitions. [2025-03-16 19:26:38,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) 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:26:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 9542 states and 13351 transitions. [2025-03-16 19:26:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:26:38,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:38,680 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:26:38,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:26:38,681 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:38,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash -671098659, now seen corresponding path program 1 times [2025-03-16 19:26:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:38,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086221083] [2025-03-16 19:26:38,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:38,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:38,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:26:38,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:26:38,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:38,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:38,909 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:38,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:38,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086221083] [2025-03-16 19:26:38,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086221083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:38,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:38,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:26:38,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624634154] [2025-03-16 19:26:38,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:38,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:26:38,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:38,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:26:38,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:26:38,912 INFO L87 Difference]: Start difference. First operand 9542 states and 13351 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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:26:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:39,632 INFO L93 Difference]: Finished difference Result 20684 states and 29458 transitions. [2025-03-16 19:26:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:26:39,632 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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:26:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:39,647 INFO L225 Difference]: With dead ends: 20684 [2025-03-16 19:26:39,647 INFO L226 Difference]: Without dead ends: 14476 [2025-03-16 19:26:39,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:26:39,654 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 2581 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2581 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:39,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2581 Valid, 1819 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:26:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14476 states. [2025-03-16 19:26:39,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14476 to 9530. [2025-03-16 19:26:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9530 states, 9523 states have (on average 1.3995589625118134) internal successors, (13328), 9529 states have internal predecessors, (13328), 0 states have call successors, (0), 0 states 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:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9530 states to 9530 states and 13328 transitions. [2025-03-16 19:26:39,824 INFO L78 Accepts]: Start accepts. Automaton has 9530 states and 13328 transitions. Word has length 67 [2025-03-16 19:26:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:39,824 INFO L471 AbstractCegarLoop]: Abstraction has 9530 states and 13328 transitions. [2025-03-16 19:26:39,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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:26:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 9530 states and 13328 transitions. [2025-03-16 19:26:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:26:39,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:39,830 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:26:39,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:26:39,830 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:39,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:39,831 INFO L85 PathProgramCache]: Analyzing trace with hash 126697724, now seen corresponding path program 1 times [2025-03-16 19:26:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:39,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429693777] [2025-03-16 19:26:39,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:39,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:39,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:26:39,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:26:39,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:39,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:40,081 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:40,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429693777] [2025-03-16 19:26:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429693777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:40,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:40,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:26:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726581232] [2025-03-16 19:26:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:40,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:26:40,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:40,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:26:40,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:26:40,083 INFO L87 Difference]: Start difference. First operand 9530 states and 13328 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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:26:40,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:40,777 INFO L93 Difference]: Finished difference Result 20837 states and 29683 transitions. [2025-03-16 19:26:40,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:26:40,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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:26:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:40,795 INFO L225 Difference]: With dead ends: 20837 [2025-03-16 19:26:40,795 INFO L226 Difference]: Without dead ends: 14602 [2025-03-16 19:26:40,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:26:40,804 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 2642 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2642 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:40,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2642 Valid, 1764 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:26:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2025-03-16 19:26:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 9506. [2025-03-16 19:26:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9506 states, 9499 states have (on average 1.3989893673018212) internal successors, (13289), 9505 states have internal predecessors, (13289), 0 states have call successors, (0), 0 states 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:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9506 states to 9506 states and 13289 transitions. [2025-03-16 19:26:40,981 INFO L78 Accepts]: Start accepts. Automaton has 9506 states and 13289 transitions. Word has length 67 [2025-03-16 19:26:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:40,981 INFO L471 AbstractCegarLoop]: Abstraction has 9506 states and 13289 transitions. [2025-03-16 19:26:40,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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:26:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 9506 states and 13289 transitions. [2025-03-16 19:26:40,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:26:40,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:40,987 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:26:40,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:26:40,987 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:40,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1967146513, now seen corresponding path program 1 times [2025-03-16 19:26:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:40,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937369697] [2025-03-16 19:26:40,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:40,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:41,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:26:41,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:26:41,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:41,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:41,203 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:41,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:41,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937369697] [2025-03-16 19:26:41,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937369697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:41,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:41,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:26:41,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715114202] [2025-03-16 19:26:41,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:41,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:26:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:41,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:26:41,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:26:41,204 INFO L87 Difference]: Start difference. First operand 9506 states and 13289 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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:26:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:41,792 INFO L93 Difference]: Finished difference Result 19466 states and 27689 transitions. [2025-03-16 19:26:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:26:41,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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:26:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:41,802 INFO L225 Difference]: With dead ends: 19466 [2025-03-16 19:26:41,802 INFO L226 Difference]: Without dead ends: 13007 [2025-03-16 19:26:41,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:26:41,809 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 2526 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2526 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:41,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2526 Valid, 1755 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:26:41,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13007 states. [2025-03-16 19:26:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13007 to 9371. [2025-03-16 19:26:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9371 states, 9364 states have (on average 1.3989747970952584) internal successors, (13100), 9370 states have internal predecessors, (13100), 0 states have call successors, (0), 0 states 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:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9371 states to 9371 states and 13100 transitions. [2025-03-16 19:26:41,906 INFO L78 Accepts]: Start accepts. Automaton has 9371 states and 13100 transitions. Word has length 67 [2025-03-16 19:26:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:41,906 INFO L471 AbstractCegarLoop]: Abstraction has 9371 states and 13100 transitions. [2025-03-16 19:26:41,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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:26:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 9371 states and 13100 transitions. [2025-03-16 19:26:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:26:41,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:41,911 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:26:41,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:26:41,911 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:41,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1263227221, now seen corresponding path program 1 times [2025-03-16 19:26:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:41,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361912362] [2025-03-16 19:26:41,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:41,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:26:41,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:26:41,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:41,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:42,505 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:42,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:42,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361912362] [2025-03-16 19:26:42,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361912362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:42,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:42,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:26:42,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435143547] [2025-03-16 19:26:42,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:42,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:26:42,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:42,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:26:42,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:26:42,508 INFO L87 Difference]: Start difference. First operand 9371 states and 13100 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 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:26:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:43,632 INFO L93 Difference]: Finished difference Result 30355 states and 43549 transitions. [2025-03-16 19:26:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:26:43,632 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 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:26:43,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:43,657 INFO L225 Difference]: With dead ends: 30355 [2025-03-16 19:26:43,657 INFO L226 Difference]: Without dead ends: 24150 [2025-03-16 19:26:43,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:26:43,669 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 4811 mSDsluCounter, 4319 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4811 SdHoareTripleChecker+Valid, 4913 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:43,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4811 Valid, 4913 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:26:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24150 states. [2025-03-16 19:26:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24150 to 9351. [2025-03-16 19:26:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9351 states, 9345 states have (on average 1.3978598180845372) internal successors, (13063), 9350 states have internal predecessors, (13063), 0 states have call successors, (0), 0 states 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:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9351 states to 9351 states and 13063 transitions. [2025-03-16 19:26:43,854 INFO L78 Accepts]: Start accepts. Automaton has 9351 states and 13063 transitions. Word has length 68 [2025-03-16 19:26:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:43,855 INFO L471 AbstractCegarLoop]: Abstraction has 9351 states and 13063 transitions. [2025-03-16 19:26:43,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 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:26:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 9351 states and 13063 transitions. [2025-03-16 19:26:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:26:43,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:43,859 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:26:43,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:26:43,859 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:43,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash 717939569, now seen corresponding path program 1 times [2025-03-16 19:26:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:43,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398827670] [2025-03-16 19:26:43,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:43,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:43,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:26:43,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:26:43,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:43,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:44,239 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:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:44,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398827670] [2025-03-16 19:26:44,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398827670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:44,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:44,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:26:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560438226] [2025-03-16 19:26:44,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:44,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:26:44,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:44,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:26:44,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:44,241 INFO L87 Difference]: Start difference. First operand 9351 states and 13063 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 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:26:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:44,824 INFO L93 Difference]: Finished difference Result 22461 states and 32124 transitions. [2025-03-16 19:26:44,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:26:44,824 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 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:26:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:44,841 INFO L225 Difference]: With dead ends: 22461 [2025-03-16 19:26:44,841 INFO L226 Difference]: Without dead ends: 16211 [2025-03-16 19:26:44,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:26:44,849 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 3840 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3840 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:44,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3840 Valid, 2848 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:26:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16211 states. [2025-03-16 19:26:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16211 to 9286. [2025-03-16 19:26:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9286 states, 9281 states have (on average 1.3971554789354594) internal successors, (12967), 9285 states have internal predecessors, (12967), 0 states have call successors, (0), 0 states 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:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 12967 transitions. [2025-03-16 19:26:44,958 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 12967 transitions. Word has length 68 [2025-03-16 19:26:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:44,959 INFO L471 AbstractCegarLoop]: Abstraction has 9286 states and 12967 transitions. [2025-03-16 19:26:44,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 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:26:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 12967 transitions. [2025-03-16 19:26:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:26:44,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:44,964 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:26:44,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:26:44,964 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:44,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1995996318, now seen corresponding path program 1 times [2025-03-16 19:26:44,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:44,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237017535] [2025-03-16 19:26:44,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:44,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:44,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:26:44,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:26:44,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:44,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:45,016 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:45,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237017535] [2025-03-16 19:26:45,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237017535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:45,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:45,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:45,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569526039] [2025-03-16 19:26:45,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:45,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:45,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:45,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:45,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:45,018 INFO L87 Difference]: Start difference. First operand 9286 states and 12967 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:26:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:45,084 INFO L93 Difference]: Finished difference Result 12877 states and 18074 transitions. [2025-03-16 19:26:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:45,084 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:26:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:45,092 INFO L225 Difference]: With dead ends: 12877 [2025-03-16 19:26:45,093 INFO L226 Difference]: Without dead ends: 9290 [2025-03-16 19:26:45,096 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:45,096 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 446 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:45,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1336 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9290 states. [2025-03-16 19:26:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9290 to 9286. [2025-03-16 19:26:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9286 states, 9281 states have (on average 1.3836871026829005) internal successors, (12842), 9285 states have internal predecessors, (12842), 0 states have call successors, (0), 0 states 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:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 12842 transitions. [2025-03-16 19:26:45,183 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 12842 transitions. Word has length 68 [2025-03-16 19:26:45,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:45,183 INFO L471 AbstractCegarLoop]: Abstraction has 9286 states and 12842 transitions. [2025-03-16 19:26:45,183 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:26:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 12842 transitions. [2025-03-16 19:26:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:26:45,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:45,189 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:26:45,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:26:45,189 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:45,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:45,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1926403871, now seen corresponding path program 1 times [2025-03-16 19:26:45,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:45,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553520307] [2025-03-16 19:26:45,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:45,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:45,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:26:45,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:26:45,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:45,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:45,597 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:45,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:45,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553520307] [2025-03-16 19:26:45,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553520307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:45,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:45,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:26:45,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630051913] [2025-03-16 19:26:45,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:45,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:26:45,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:45,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:26:45,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:45,599 INFO L87 Difference]: Start difference. First operand 9286 states and 12842 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 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:26:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:46,138 INFO L93 Difference]: Finished difference Result 15339 states and 21512 transitions. [2025-03-16 19:26:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:26:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 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:26:46,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:46,149 INFO L225 Difference]: With dead ends: 15339 [2025-03-16 19:26:46,150 INFO L226 Difference]: Without dead ends: 12120 [2025-03-16 19:26:46,155 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:26:46,155 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 3687 mSDsluCounter, 2438 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3687 SdHoareTripleChecker+Valid, 2997 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:46,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3687 Valid, 2997 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:26:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12120 states. [2025-03-16 19:26:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12120 to 9201. [2025-03-16 19:26:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9201 states, 9197 states have (on average 1.3824073067304556) internal successors, (12714), 9200 states have internal predecessors, (12714), 0 states have call successors, (0), 0 states 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,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9201 states to 9201 states and 12714 transitions. [2025-03-16 19:26:46,245 INFO L78 Accepts]: Start accepts. Automaton has 9201 states and 12714 transitions. Word has length 68 [2025-03-16 19:26:46,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:46,246 INFO L471 AbstractCegarLoop]: Abstraction has 9201 states and 12714 transitions. [2025-03-16 19:26:46,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 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:26:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 9201 states and 12714 transitions. [2025-03-16 19:26:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:26:46,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:46,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:46,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:26:46,250 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:46,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:46,250 INFO L85 PathProgramCache]: Analyzing trace with hash 775746641, now seen corresponding path program 1 times [2025-03-16 19:26:46,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:46,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009466083] [2025-03-16 19:26:46,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:46,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:46,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:26:46,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:26:46,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:46,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:46,633 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:46,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:46,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009466083] [2025-03-16 19:26:46,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009466083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:46,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:46,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:26:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462382427] [2025-03-16 19:26:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:46,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:26:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:46,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:26:46,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:26:46,636 INFO L87 Difference]: Start difference. First operand 9201 states and 12714 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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:26:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:47,163 INFO L93 Difference]: Finished difference Result 18817 states and 26530 transitions. [2025-03-16 19:26:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:26:47,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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:26:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:47,179 INFO L225 Difference]: With dead ends: 18817 [2025-03-16 19:26:47,179 INFO L226 Difference]: Without dead ends: 15464 [2025-03-16 19:26:47,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:26:47,186 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 2293 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2293 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:47,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2293 Valid, 1779 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:26:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15464 states. [2025-03-16 19:26:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15464 to 9000. [2025-03-16 19:26:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9000 states, 8997 states have (on average 1.3819050794709347) internal successors, (12433), 8999 states have internal predecessors, (12433), 0 states have call successors, (0), 0 states 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:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 12433 transitions. [2025-03-16 19:26:47,334 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 12433 transitions. Word has length 68 [2025-03-16 19:26:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:47,334 INFO L471 AbstractCegarLoop]: Abstraction has 9000 states and 12433 transitions. [2025-03-16 19:26:47,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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:26:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 12433 transitions. [2025-03-16 19:26:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:26:47,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:47,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:47,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:26:47,341 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:47,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash 59126906, now seen corresponding path program 1 times [2025-03-16 19:26:47,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:47,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36732381] [2025-03-16 19:26:47,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:47,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:47,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:26:47,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:26:47,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:47,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:47,384 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:47,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:47,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36732381] [2025-03-16 19:26:47,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36732381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:47,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:47,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:47,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065968405] [2025-03-16 19:26:47,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:47,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:47,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:47,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:47,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:47,386 INFO L87 Difference]: Start difference. First operand 9000 states and 12433 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:47,442 INFO L93 Difference]: Finished difference Result 13913 states and 19333 transitions. [2025-03-16 19:26:47,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:47,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:26:47,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:47,453 INFO L225 Difference]: With dead ends: 13913 [2025-03-16 19:26:47,453 INFO L226 Difference]: Without dead ends: 9829 [2025-03-16 19:26:47,458 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:47,462 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 515 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:47,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 765 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9829 states. [2025-03-16 19:26:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9829 to 8508. [2025-03-16 19:26:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8508 states, 8505 states have (on average 1.3875367430922987) internal successors, (11801), 8507 states have internal predecessors, (11801), 0 states have call successors, (0), 0 states 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:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8508 states to 8508 states and 11801 transitions. [2025-03-16 19:26:47,544 INFO L78 Accepts]: Start accepts. Automaton has 8508 states and 11801 transitions. Word has length 69 [2025-03-16 19:26:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:47,544 INFO L471 AbstractCegarLoop]: Abstraction has 8508 states and 11801 transitions. [2025-03-16 19:26:47,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 8508 states and 11801 transitions. [2025-03-16 19:26:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:26:47,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:47,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:47,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:26:47,549 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:47,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:47,550 INFO L85 PathProgramCache]: Analyzing trace with hash 63523138, now seen corresponding path program 1 times [2025-03-16 19:26:47,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:47,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816542007] [2025-03-16 19:26:47,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:47,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:47,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:26:47,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:26:47,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:47,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:47,638 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:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816542007] [2025-03-16 19:26:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816542007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:47,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:47,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:47,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079323258] [2025-03-16 19:26:47,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:47,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:26:47,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:47,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:26:47,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:26:47,640 INFO L87 Difference]: Start difference. First operand 8508 states and 11801 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:48,099 INFO L93 Difference]: Finished difference Result 19239 states and 27021 transitions. [2025-03-16 19:26:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:26:48,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:26:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:48,116 INFO L225 Difference]: With dead ends: 19239 [2025-03-16 19:26:48,116 INFO L226 Difference]: Without dead ends: 17137 [2025-03-16 19:26:48,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:48,123 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 2613 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2613 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:48,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2613 Valid, 944 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:26:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17137 states. [2025-03-16 19:26:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17137 to 8559. [2025-03-16 19:26:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8559 states, 8556 states have (on average 1.3874474053295933) internal successors, (11871), 8558 states have internal predecessors, (11871), 0 states have call successors, (0), 0 states 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:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8559 states to 8559 states and 11871 transitions. [2025-03-16 19:26:48,248 INFO L78 Accepts]: Start accepts. Automaton has 8559 states and 11871 transitions. Word has length 70 [2025-03-16 19:26:48,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:48,248 INFO L471 AbstractCegarLoop]: Abstraction has 8559 states and 11871 transitions. [2025-03-16 19:26:48,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 8559 states and 11871 transitions. [2025-03-16 19:26:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:26:48,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:48,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:48,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:26:48,252 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:48,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1192744498, now seen corresponding path program 1 times [2025-03-16 19:26:48,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:48,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102842669] [2025-03-16 19:26:48,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:48,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:48,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:26:48,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:26:48,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:48,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:48,296 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:48,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:48,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102842669] [2025-03-16 19:26:48,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102842669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:48,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:48,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858514877] [2025-03-16 19:26:48,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:48,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:48,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:48,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:48,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:48,297 INFO L87 Difference]: Start difference. First operand 8559 states and 11871 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:48,392 INFO L93 Difference]: Finished difference Result 17697 states and 24774 transitions. [2025-03-16 19:26:48,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:48,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:26:48,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:48,404 INFO L225 Difference]: With dead ends: 17697 [2025-03-16 19:26:48,405 INFO L226 Difference]: Without dead ends: 12433 [2025-03-16 19:26:48,411 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:48,412 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 404 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:48,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 552 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:26:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12433 states. [2025-03-16 19:26:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12433 to 12395. [2025-03-16 19:26:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12395 states, 12393 states have (on average 1.4060356652949246) internal successors, (17425), 12394 states have internal predecessors, (17425), 0 states have call successors, (0), 0 states 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:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12395 states to 12395 states and 17425 transitions. [2025-03-16 19:26:48,547 INFO L78 Accepts]: Start accepts. Automaton has 12395 states and 17425 transitions. Word has length 70 [2025-03-16 19:26:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:48,547 INFO L471 AbstractCegarLoop]: Abstraction has 12395 states and 17425 transitions. [2025-03-16 19:26:48,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 12395 states and 17425 transitions. [2025-03-16 19:26:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:26:48,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:48,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:48,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:26:48,551 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:48,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash 880820715, now seen corresponding path program 1 times [2025-03-16 19:26:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:48,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648597766] [2025-03-16 19:26:48,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:48,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:48,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:26:48,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:26:48,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:48,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:48,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:48,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648597766] [2025-03-16 19:26:48,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648597766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:48,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:48,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:26:48,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872674270] [2025-03-16 19:26:48,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:48,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:26:48,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:48,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:26:48,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:26:48,712 INFO L87 Difference]: Start difference. First operand 12395 states and 17425 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:49,220 INFO L93 Difference]: Finished difference Result 25056 states and 35558 transitions. [2025-03-16 19:26:49,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:26:49,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:26:49,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:49,241 INFO L225 Difference]: With dead ends: 25056 [2025-03-16 19:26:49,241 INFO L226 Difference]: Without dead ends: 19772 [2025-03-16 19:26:49,248 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:49,249 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 1003 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:49,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 1377 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:26:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19772 states. [2025-03-16 19:26:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19772 to 12323. [2025-03-16 19:26:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12323 states, 12321 states have (on average 1.4062981900819738) internal successors, (17327), 12322 states have internal predecessors, (17327), 0 states have call successors, (0), 0 states 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:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12323 states to 12323 states and 17327 transitions. [2025-03-16 19:26:49,382 INFO L78 Accepts]: Start accepts. Automaton has 12323 states and 17327 transitions. Word has length 71 [2025-03-16 19:26:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:49,382 INFO L471 AbstractCegarLoop]: Abstraction has 12323 states and 17327 transitions. [2025-03-16 19:26:49,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 12323 states and 17327 transitions. [2025-03-16 19:26:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:26:49,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:49,385 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:26:49,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:26:49,386 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:49,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2066105096, now seen corresponding path program 1 times [2025-03-16 19:26:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:49,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036488823] [2025-03-16 19:26:49,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:49,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:26:49,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:26:49,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:49,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:49,426 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:49,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:49,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036488823] [2025-03-16 19:26:49,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036488823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:49,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:49,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:49,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793779467] [2025-03-16 19:26:49,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:49,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:49,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:49,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:49,427 INFO L87 Difference]: Start difference. First operand 12323 states and 17327 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:49,474 INFO L93 Difference]: Finished difference Result 19300 states and 27280 transitions. [2025-03-16 19:26:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:49,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 19:26:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:49,485 INFO L225 Difference]: With dead ends: 19300 [2025-03-16 19:26:49,485 INFO L226 Difference]: Without dead ends: 12327 [2025-03-16 19:26:49,491 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:49,491 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 239 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:49,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 975 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12327 states. [2025-03-16 19:26:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12327 to 12323. [2025-03-16 19:26:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12323 states, 12321 states have (on average 1.3933933933933933) internal successors, (17168), 12322 states have internal predecessors, (17168), 0 states have call successors, (0), 0 states 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:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12323 states to 12323 states and 17168 transitions. [2025-03-16 19:26:49,589 INFO L78 Accepts]: Start accepts. Automaton has 12323 states and 17168 transitions. Word has length 72 [2025-03-16 19:26:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:49,590 INFO L471 AbstractCegarLoop]: Abstraction has 12323 states and 17168 transitions. [2025-03-16 19:26:49,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 12323 states and 17168 transitions. [2025-03-16 19:26:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:26:49,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:49,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:49,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:26:49,594 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:49,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2050762392, now seen corresponding path program 1 times [2025-03-16 19:26:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186589479] [2025-03-16 19:26:49,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:49,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:26:49,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:26:49,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:49,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:49,922 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:49,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:49,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186589479] [2025-03-16 19:26:49,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186589479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:49,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:49,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:26:49,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507414205] [2025-03-16 19:26:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:49,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:26:49,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:49,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:26:49,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:26:49,923 INFO L87 Difference]: Start difference. First operand 12323 states and 17168 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:50,351 INFO L93 Difference]: Finished difference Result 19478 states and 27407 transitions. [2025-03-16 19:26:50,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:26:50,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:26:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:50,363 INFO L225 Difference]: With dead ends: 19478 [2025-03-16 19:26:50,363 INFO L226 Difference]: Without dead ends: 14152 [2025-03-16 19:26:50,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:26:50,369 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 2676 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:50,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2676 Valid, 2147 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:26:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14152 states. [2025-03-16 19:26:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14152 to 12126. [2025-03-16 19:26:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12126 states, 12125 states have (on average 1.3957113402061856) internal successors, (16923), 12125 states have internal predecessors, (16923), 0 states have call successors, (0), 0 states 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:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12126 states to 12126 states and 16923 transitions. [2025-03-16 19:26:50,477 INFO L78 Accepts]: Start accepts. Automaton has 12126 states and 16923 transitions. Word has length 74 [2025-03-16 19:26:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:50,477 INFO L471 AbstractCegarLoop]: Abstraction has 12126 states and 16923 transitions. [2025-03-16 19:26:50,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 12126 states and 16923 transitions. [2025-03-16 19:26:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:26:50,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:50,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, 1, 1, 1, 1, 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:50,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:26:50,485 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:50,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash -231114352, now seen corresponding path program 1 times [2025-03-16 19:26:50,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:50,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231231016] [2025-03-16 19:26:50,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:50,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:50,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:26:50,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:26:50,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:50,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:50,559 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:50,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:50,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231231016] [2025-03-16 19:26:50,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231231016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:50,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:50,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:50,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495265307] [2025-03-16 19:26:50,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:50,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:50,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:50,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:50,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:50,560 INFO L87 Difference]: Start difference. First operand 12126 states and 16923 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) 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:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:50,717 INFO L93 Difference]: Finished difference Result 50614 states and 72421 transitions. [2025-03-16 19:26:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:50,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) 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 83 [2025-03-16 19:26:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:50,760 INFO L225 Difference]: With dead ends: 50614 [2025-03-16 19:26:50,760 INFO L226 Difference]: Without dead ends: 40631 [2025-03-16 19:26:50,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:50,779 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 2093 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:50,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 1072 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40631 states. [2025-03-16 19:26:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40631 to 22107. [2025-03-16 19:26:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22107 states, 22106 states have (on average 1.4002533248891704) internal successors, (30954), 22106 states have internal predecessors, (30954), 0 states have call successors, (0), 0 states 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:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22107 states to 22107 states and 30954 transitions. [2025-03-16 19:26:51,095 INFO L78 Accepts]: Start accepts. Automaton has 22107 states and 30954 transitions. Word has length 83 [2025-03-16 19:26:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:51,095 INFO L471 AbstractCegarLoop]: Abstraction has 22107 states and 30954 transitions. [2025-03-16 19:26:51,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) 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:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 22107 states and 30954 transitions. [2025-03-16 19:26:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:26:51,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:51,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:51,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:26:51,109 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:51,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:51,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1454974167, now seen corresponding path program 1 times [2025-03-16 19:26:51,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:51,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389443853] [2025-03-16 19:26:51,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:51,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:51,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:26:51,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:26:51,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:51,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:51,231 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:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389443853] [2025-03-16 19:26:51,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389443853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:51,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:51,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:51,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622846424] [2025-03-16 19:26:51,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:51,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:51,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:51,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:51,232 INFO L87 Difference]: Start difference. First operand 22107 states and 30954 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:51,403 INFO L93 Difference]: Finished difference Result 34559 states and 48374 transitions. [2025-03-16 19:26:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:51,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:26:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:51,428 INFO L225 Difference]: With dead ends: 34559 [2025-03-16 19:26:51,429 INFO L226 Difference]: Without dead ends: 22470 [2025-03-16 19:26:51,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:51,442 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 1089 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:51,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1383 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:26:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22470 states. [2025-03-16 19:26:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22470 to 16554. [2025-03-16 19:26:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16554 states, 16553 states have (on average 1.3808977224672265) internal successors, (22858), 16553 states have internal predecessors, (22858), 0 states have call successors, (0), 0 states 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:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16554 states to 16554 states and 22858 transitions. [2025-03-16 19:26:51,624 INFO L78 Accepts]: Start accepts. Automaton has 16554 states and 22858 transitions. Word has length 84 [2025-03-16 19:26:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:51,624 INFO L471 AbstractCegarLoop]: Abstraction has 16554 states and 22858 transitions. [2025-03-16 19:26:51,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 16554 states and 22858 transitions. [2025-03-16 19:26:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:26:51,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:51,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:51,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:26:51,638 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:51,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:51,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1509544831, now seen corresponding path program 1 times [2025-03-16 19:26:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:51,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394985833] [2025-03-16 19:26:51,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:51,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:26:51,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:26:51,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:51,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:51,708 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:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:51,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394985833] [2025-03-16 19:26:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394985833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:51,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546767296] [2025-03-16 19:26:51,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:51,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:51,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:51,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:51,709 INFO L87 Difference]: Start difference. First operand 16554 states and 22858 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:51,800 INFO L93 Difference]: Finished difference Result 44954 states and 62688 transitions. [2025-03-16 19:26:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:51,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:26:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:51,833 INFO L225 Difference]: With dead ends: 44954 [2025-03-16 19:26:51,833 INFO L226 Difference]: Without dead ends: 30314 [2025-03-16 19:26:51,849 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:51,849 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 143 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:51,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 851 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30314 states. [2025-03-16 19:26:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30314 to 28424. [2025-03-16 19:26:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28424 states, 28423 states have (on average 1.3809942652077543) internal successors, (39252), 28423 states have internal predecessors, (39252), 0 states have call successors, (0), 0 states 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:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28424 states to 28424 states and 39252 transitions. [2025-03-16 19:26:52,129 INFO L78 Accepts]: Start accepts. Automaton has 28424 states and 39252 transitions. Word has length 85 [2025-03-16 19:26:52,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:52,129 INFO L471 AbstractCegarLoop]: Abstraction has 28424 states and 39252 transitions. [2025-03-16 19:26:52,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 28424 states and 39252 transitions. [2025-03-16 19:26:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:26:52,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:52,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:52,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:26:52,140 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:52,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1092288388, now seen corresponding path program 1 times [2025-03-16 19:26:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:52,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960301560] [2025-03-16 19:26:52,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:52,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:26:52,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:26:52,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:52,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:52,194 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:52,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:52,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960301560] [2025-03-16 19:26:52,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960301560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:52,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:52,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:52,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134076844] [2025-03-16 19:26:52,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:52,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:52,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:52,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:52,196 INFO L87 Difference]: Start difference. First operand 28424 states and 39252 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:52,273 INFO L93 Difference]: Finished difference Result 36897 states and 50980 transitions. [2025-03-16 19:26:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 19:26:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:52,297 INFO L225 Difference]: With dead ends: 36897 [2025-03-16 19:26:52,297 INFO L226 Difference]: Without dead ends: 20430 [2025-03-16 19:26:52,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:52,312 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 242 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:52,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 902 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2025-03-16 19:26:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 20428. [2025-03-16 19:26:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20428 states, 20427 states have (on average 1.3723992754687424) internal successors, (28034), 20427 states have internal predecessors, (28034), 0 states have call successors, (0), 0 states 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:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20428 states to 20428 states and 28034 transitions. [2025-03-16 19:26:52,623 INFO L78 Accepts]: Start accepts. Automaton has 20428 states and 28034 transitions. Word has length 86 [2025-03-16 19:26:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:52,624 INFO L471 AbstractCegarLoop]: Abstraction has 20428 states and 28034 transitions. [2025-03-16 19:26:52,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 20428 states and 28034 transitions. [2025-03-16 19:26:52,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:26:52,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:52,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:52,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:26:52,634 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:52,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1843590533, now seen corresponding path program 1 times [2025-03-16 19:26:52,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:52,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940499454] [2025-03-16 19:26:52,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:52,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:52,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:26:52,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:26:52,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:52,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:52,735 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:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940499454] [2025-03-16 19:26:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940499454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:52,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:52,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671597535] [2025-03-16 19:26:52,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:52,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:52,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:52,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:52,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:52,736 INFO L87 Difference]: Start difference. First operand 20428 states and 28034 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:52,879 INFO L93 Difference]: Finished difference Result 56360 states and 77884 transitions. [2025-03-16 19:26:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:52,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 19:26:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:52,917 INFO L225 Difference]: With dead ends: 56360 [2025-03-16 19:26:52,917 INFO L226 Difference]: Without dead ends: 37754 [2025-03-16 19:26:52,935 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:52,936 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 130 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:52,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 833 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37754 states. [2025-03-16 19:26:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37754 to 35320. [2025-03-16 19:26:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35320 states, 35319 states have (on average 1.3728021744670007) internal successors, (48486), 35319 states have internal predecessors, (48486), 0 states have call successors, (0), 0 states 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:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35320 states to 35320 states and 48486 transitions. [2025-03-16 19:26:53,272 INFO L78 Accepts]: Start accepts. Automaton has 35320 states and 48486 transitions. Word has length 86 [2025-03-16 19:26:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:53,272 INFO L471 AbstractCegarLoop]: Abstraction has 35320 states and 48486 transitions. [2025-03-16 19:26:53,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 35320 states and 48486 transitions. [2025-03-16 19:26:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:26:53,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:53,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:53,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:26:53,280 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:53,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1961995677, now seen corresponding path program 1 times [2025-03-16 19:26:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:53,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189650850] [2025-03-16 19:26:53,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:53,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:53,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:26:53,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:26:53,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:53,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:53,346 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:53,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:53,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189650850] [2025-03-16 19:26:53,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189650850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:53,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:53,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:53,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323357665] [2025-03-16 19:26:53,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:53,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:53,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:53,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:53,347 INFO L87 Difference]: Start difference. First operand 35320 states and 48486 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:53,535 INFO L93 Difference]: Finished difference Result 99756 states and 137304 transitions. [2025-03-16 19:26:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:53,603 INFO L225 Difference]: With dead ends: 99756 [2025-03-16 19:26:53,603 INFO L226 Difference]: Without dead ends: 66258 [2025-03-16 19:26:53,636 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:53,636 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 108 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:53,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 813 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66258 states. [2025-03-16 19:26:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66258 to 62288. [2025-03-16 19:26:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62288 states, 62287 states have (on average 1.3693708157400422) internal successors, (85294), 62287 states have internal predecessors, (85294), 0 states have call successors, (0), 0 states 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:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62288 states to 62288 states and 85294 transitions. [2025-03-16 19:26:54,319 INFO L78 Accepts]: Start accepts. Automaton has 62288 states and 85294 transitions. Word has length 88 [2025-03-16 19:26:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:54,319 INFO L471 AbstractCegarLoop]: Abstraction has 62288 states and 85294 transitions. [2025-03-16 19:26:54,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 62288 states and 85294 transitions. [2025-03-16 19:26:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:26:54,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:54,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:54,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:26:54,327 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:54,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1275433608, now seen corresponding path program 1 times [2025-03-16 19:26:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:54,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587499992] [2025-03-16 19:26:54,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:54,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:54,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:26:54,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:26:54,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:54,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:54,371 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:54,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:54,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587499992] [2025-03-16 19:26:54,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587499992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:54,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:54,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:54,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255776090] [2025-03-16 19:26:54,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:54,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:54,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:54,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:54,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:54,373 INFO L87 Difference]: Start difference. First operand 62288 states and 85294 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:54,675 INFO L93 Difference]: Finished difference Result 175908 states and 240352 transitions. [2025-03-16 19:26:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:54,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:54,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:54,808 INFO L225 Difference]: With dead ends: 175908 [2025-03-16 19:26:54,809 INFO L226 Difference]: Without dead ends: 115442 [2025-03-16 19:26:54,865 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:54,866 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 343 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:54,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 586 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115442 states. [2025-03-16 19:26:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115442 to 113968. [2025-03-16 19:26:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113968 states, 113967 states have (on average 1.3405810453903322) internal successors, (152782), 113967 states have internal predecessors, (152782), 0 states have call successors, (0), 0 states 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:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113968 states to 113968 states and 152782 transitions. [2025-03-16 19:26:56,215 INFO L78 Accepts]: Start accepts. Automaton has 113968 states and 152782 transitions. Word has length 89 [2025-03-16 19:26:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:56,215 INFO L471 AbstractCegarLoop]: Abstraction has 113968 states and 152782 transitions. [2025-03-16 19:26:56,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 113968 states and 152782 transitions. [2025-03-16 19:26:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:26:56,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:56,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:56,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:26:56,225 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:56,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1337473222, now seen corresponding path program 1 times [2025-03-16 19:26:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:56,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579323760] [2025-03-16 19:26:56,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:56,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:26:56,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:26:56,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:56,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:56,291 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:56,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:56,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579323760] [2025-03-16 19:26:56,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579323760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:56,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:56,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415234468] [2025-03-16 19:26:56,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:56,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:56,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:56,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:56,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:56,293 INFO L87 Difference]: Start difference. First operand 113968 states and 152782 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:56,887 INFO L93 Difference]: Finished difference Result 293380 states and 393856 transitions. [2025-03-16 19:26:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:56,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:57,627 INFO L225 Difference]: With dead ends: 293380 [2025-03-16 19:26:57,627 INFO L226 Difference]: Without dead ends: 181234 [2025-03-16 19:26:57,671 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:57,672 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 152 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:57,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 869 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181234 states. [2025-03-16 19:26:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181234 to 164784. [2025-03-16 19:26:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164784 states, 164783 states have (on average 1.3314844371081969) internal successors, (219406), 164783 states have internal predecessors, (219406), 0 states have call successors, (0), 0 states 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:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164784 states to 164784 states and 219406 transitions. [2025-03-16 19:26:59,917 INFO L78 Accepts]: Start accepts. Automaton has 164784 states and 219406 transitions. Word has length 89 [2025-03-16 19:26:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:59,918 INFO L471 AbstractCegarLoop]: Abstraction has 164784 states and 219406 transitions. [2025-03-16 19:26:59,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 164784 states and 219406 transitions. [2025-03-16 19:26:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:26:59,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:59,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:59,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:26:59,925 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:26:59,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash -908715172, now seen corresponding path program 1 times [2025-03-16 19:26:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:59,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117735334] [2025-03-16 19:26:59,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:59,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:26:59,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:26:59,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:59,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:00,141 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:27:00,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:00,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117735334] [2025-03-16 19:27:00,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117735334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:00,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:00,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:00,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625457197] [2025-03-16 19:27:00,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:00,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:00,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:00,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:00,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:00,142 INFO L87 Difference]: Start difference. First operand 164784 states and 219406 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:00,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:00,674 INFO L93 Difference]: Finished difference Result 171410 states and 228239 transitions. [2025-03-16 19:27:00,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:00,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 19:27:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:00,886 INFO L225 Difference]: With dead ends: 171410 [2025-03-16 19:27:00,887 INFO L226 Difference]: Without dead ends: 171408 [2025-03-16 19:27:00,920 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:27:00,921 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 0 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2075 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:27:00,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2075 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171408 states. [2025-03-16 19:27:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171408 to 171408. [2025-03-16 19:27:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171408 states, 171407 states have (on average 1.305792645574568) internal successors, (223822), 171407 states have internal predecessors, (223822), 0 states have call successors, (0), 0 states 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:27:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171408 states to 171408 states and 223822 transitions. [2025-03-16 19:27:02,895 INFO L78 Accepts]: Start accepts. Automaton has 171408 states and 223822 transitions. Word has length 90 [2025-03-16 19:27:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:02,895 INFO L471 AbstractCegarLoop]: Abstraction has 171408 states and 223822 transitions. [2025-03-16 19:27:02,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 171408 states and 223822 transitions. [2025-03-16 19:27:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:27:02,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:02,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:02,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:27:02,903 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:02,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash 996345364, now seen corresponding path program 1 times [2025-03-16 19:27:02,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:02,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932984312] [2025-03-16 19:27:02,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:02,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:02,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:27:02,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:27:02,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:02,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:03,015 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:27:03,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:03,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932984312] [2025-03-16 19:27:03,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932984312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:03,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:03,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:03,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393695906] [2025-03-16 19:27:03,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:03,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:03,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:03,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:03,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:03,016 INFO L87 Difference]: Start difference. First operand 171408 states and 223822 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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:27:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:03,951 INFO L93 Difference]: Finished difference Result 274402 states and 360043 transitions. [2025-03-16 19:27:03,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:03,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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:27:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:04,283 INFO L225 Difference]: With dead ends: 274402 [2025-03-16 19:27:04,284 INFO L226 Difference]: Without dead ends: 239192 [2025-03-16 19:27:04,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:04,355 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 1569 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:04,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 1295 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239192 states. [2025-03-16 19:27:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239192 to 198168. [2025-03-16 19:27:06,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198168 states, 198167 states have (on average 1.3038195057703856) internal successors, (258374), 198167 states have internal predecessors, (258374), 0 states have call successors, (0), 0 states 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:27:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198168 states to 198168 states and 258374 transitions. [2025-03-16 19:27:07,027 INFO L78 Accepts]: Start accepts. Automaton has 198168 states and 258374 transitions. Word has length 92 [2025-03-16 19:27:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:07,028 INFO L471 AbstractCegarLoop]: Abstraction has 198168 states and 258374 transitions. [2025-03-16 19:27:07,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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:27:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 198168 states and 258374 transitions. [2025-03-16 19:27:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 19:27:07,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:07,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:07,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:27:07,036 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:07,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1444569666, now seen corresponding path program 1 times [2025-03-16 19:27:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927887598] [2025-03-16 19:27:07,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:07,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:27:07,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:27:07,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:07,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:07,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:07,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927887598] [2025-03-16 19:27:07,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927887598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:07,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:07,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:07,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758417798] [2025-03-16 19:27:07,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:07,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:07,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:07,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:07,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:07,099 INFO L87 Difference]: Start difference. First operand 198168 states and 258374 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:08,222 INFO L93 Difference]: Finished difference Result 393002 states and 512459 transitions. [2025-03-16 19:27:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:08,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 19:27:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:08,583 INFO L225 Difference]: With dead ends: 393002 [2025-03-16 19:27:08,583 INFO L226 Difference]: Without dead ends: 274013 [2025-03-16 19:27:08,705 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:27:08,706 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 372 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:08,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 562 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274013 states. [2025-03-16 19:27:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274013 to 194729. [2025-03-16 19:27:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194729 states, 194728 states have (on average 1.3008760938334498) internal successors, (253317), 194728 states have internal predecessors, (253317), 0 states have call successors, (0), 0 states 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:27:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194729 states to 194729 states and 253317 transitions. [2025-03-16 19:27:11,563 INFO L78 Accepts]: Start accepts. Automaton has 194729 states and 253317 transitions. Word has length 93 [2025-03-16 19:27:11,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:11,563 INFO L471 AbstractCegarLoop]: Abstraction has 194729 states and 253317 transitions. [2025-03-16 19:27:11,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:11,564 INFO L276 IsEmpty]: Start isEmpty. Operand 194729 states and 253317 transitions. [2025-03-16 19:27:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:27:11,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:11,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:11,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:27:11,570 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:11,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1551153182, now seen corresponding path program 1 times [2025-03-16 19:27:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:11,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515317984] [2025-03-16 19:27:11,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:11,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:27:11,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:27:11,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:11,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:11,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:11,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515317984] [2025-03-16 19:27:11,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515317984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:11,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:11,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:27:11,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364982988] [2025-03-16 19:27:11,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:11,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:27:11,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:11,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:27:11,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:27:11,686 INFO L87 Difference]: Start difference. First operand 194729 states and 253317 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:12,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:12,689 INFO L93 Difference]: Finished difference Result 280347 states and 366242 transitions. [2025-03-16 19:27:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:12,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 19:27:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:13,023 INFO L225 Difference]: With dead ends: 280347 [2025-03-16 19:27:13,024 INFO L226 Difference]: Without dead ends: 246289 [2025-03-16 19:27:13,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:13,108 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 1565 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:13,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 1273 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:27:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246289 states. [2025-03-16 19:27:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246289 to 220721. [2025-03-16 19:27:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220721 states, 220720 states have (on average 1.2990077926785066) internal successors, (286717), 220720 states have internal predecessors, (286717), 0 states have call successors, (0), 0 states 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:27:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220721 states to 220721 states and 286717 transitions. [2025-03-16 19:27:15,984 INFO L78 Accepts]: Start accepts. Automaton has 220721 states and 286717 transitions. Word has length 94 [2025-03-16 19:27:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:15,984 INFO L471 AbstractCegarLoop]: Abstraction has 220721 states and 286717 transitions. [2025-03-16 19:27:15,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 220721 states and 286717 transitions. [2025-03-16 19:27:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:27:16,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:16,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:16,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:27:16,022 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:16,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:16,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1042138338, now seen corresponding path program 1 times [2025-03-16 19:27:16,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:16,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809022083] [2025-03-16 19:27:16,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:16,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:27:16,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:27:16,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:16,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 19:27:16,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:16,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809022083] [2025-03-16 19:27:16,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809022083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:16,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:16,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473333046] [2025-03-16 19:27:16,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:16,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:16,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:16,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:16,334 INFO L87 Difference]: Start difference. First operand 220721 states and 286717 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:27:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:17,894 INFO L93 Difference]: Finished difference Result 405237 states and 525810 transitions. [2025-03-16 19:27:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:27:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 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 115 [2025-03-16 19:27:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:18,360 INFO L225 Difference]: With dead ends: 405237 [2025-03-16 19:27:18,360 INFO L226 Difference]: Without dead ends: 315391 [2025-03-16 19:27:18,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:27:18,466 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1695 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:18,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 1041 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:27:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315391 states. [2025-03-16 19:27:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315391 to 220631. [2025-03-16 19:27:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220631 states, 220630 states have (on average 1.299007387934551) internal successors, (286600), 220630 states have internal predecessors, (286600), 0 states have call successors, (0), 0 states 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:27:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220631 states to 220631 states and 286600 transitions. [2025-03-16 19:27:21,719 INFO L78 Accepts]: Start accepts. Automaton has 220631 states and 286600 transitions. Word has length 115 [2025-03-16 19:27:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:21,719 INFO L471 AbstractCegarLoop]: Abstraction has 220631 states and 286600 transitions. [2025-03-16 19:27:21,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:27:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 220631 states and 286600 transitions. [2025-03-16 19:27:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:27:21,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:21,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:27:21,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:27:21,751 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:27:21,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1053304249, now seen corresponding path program 1 times [2025-03-16 19:27:21,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:21,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388914208] [2025-03-16 19:27:21,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:21,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:27:21,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:27:21,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:21,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 19:27:22,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:22,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388914208] [2025-03-16 19:27:22,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388914208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:22,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:22,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:27:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435116998] [2025-03-16 19:27:22,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:22,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:27:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:22,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:27:22,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:27:22,012 INFO L87 Difference]: Start difference. First operand 220631 states and 286600 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)