./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.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 a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:24:03,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:24:03,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:24:03,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:24:03,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:24:03,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:24:03,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:24:03,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:24:03,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:24:03,597 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:24:03,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:24:03,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:24:03,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:24:03,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:24:03,599 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:24:03,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:24:03,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:24:03,600 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:24:03,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:24:03,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:24:03,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:24:03,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:24:03,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:24:03,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:24:03,601 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:24:03,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:24:03,601 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:24:03,601 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:24:03,601 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:24:03,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:24:03,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:24:03,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:24:03,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:24:03,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:24:03,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:24:03,602 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:24:03,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:24:03,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:24:03,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:24:03,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:24:03,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:24:03,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:24:03,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:24:03,603 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 -> a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b [2025-03-08 06:24:03,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:24:03,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:24:03,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:24:03,820 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:24:03,821 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:24:03,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:24:04,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94b10c557/f151e32fbee245efb119047773ce4174/FLAGb9387aa7c [2025-03-08 06:24:05,248 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:24:05,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:24:05,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94b10c557/f151e32fbee245efb119047773ce4174/FLAGb9387aa7c [2025-03-08 06:24:05,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94b10c557/f151e32fbee245efb119047773ce4174 [2025-03-08 06:24:05,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:24:05,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:24:05,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:24:05,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:24:05,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:24:05,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:24:05" (1/1) ... [2025-03-08 06:24:05,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27edab46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:05, skipping insertion in model container [2025-03-08 06:24:05,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:24:05" (1/1) ... [2025-03-08 06:24:05,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:24:05,776 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2025-03-08 06:24:05,799 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2025-03-08 06:24:05,810 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2025-03-08 06:24:05,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2025-03-08 06:24:05,820 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2025-03-08 06:24:05,823 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2025-03-08 06:24:05,830 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2025-03-08 06:24:05,843 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2025-03-08 06:24:05,845 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2025-03-08 06:24:05,849 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2025-03-08 06:24:05,856 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2025-03-08 06:24:05,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:24:05,938 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:24:05,973 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2025-03-08 06:24:05,984 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2025-03-08 06:24:05,989 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2025-03-08 06:24:05,994 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2025-03-08 06:24:06,005 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2025-03-08 06:24:06,008 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2025-03-08 06:24:06,010 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2025-03-08 06:24:06,016 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2025-03-08 06:24:06,018 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2025-03-08 06:24:06,021 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2025-03-08 06:24:06,025 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2025-03-08 06:24:06,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:24:06,075 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:24:06,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06 WrapperNode [2025-03-08 06:24:06,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:24:06,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:24:06,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:24:06,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:24:06,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,134 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1924 [2025-03-08 06:24:06,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:24:06,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:24:06,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:24:06,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:24:06,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,175 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:24:06,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:24:06,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:24:06,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:24:06,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:24:06,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:24:06,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:06,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:24:06,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:24:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:24:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:24:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:24:06,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:24:06,355 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:24:06,356 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:24:07,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1624: havoc main_~check__tmp~15#1; [2025-03-08 06:24:07,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1558: havoc main_~node4__m4~8#1; [2025-03-08 06:24:07,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2748: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-08 06:24:07,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1592: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-08 06:24:07,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-08 06:24:07,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-03-08 06:24:07,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2386: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-08 06:24:07,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L338: havoc main_~node4__m4~1#1; [2025-03-08 06:24:07,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1329: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-08 06:24:07,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-08 06:24:07,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2849: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-03-08 06:24:07,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-08 06:24:07,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-08 06:24:07,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-08 06:24:07,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2454: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-03-08 06:24:07,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L968: havoc main_~node3__m3~3#1; [2025-03-08 06:24:07,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc main_~node4__m4~2#1; [2025-03-08 06:24:07,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2521: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-03-08 06:24:07,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2__m2~1#1; [2025-03-08 06:24:07,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:24:07,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2226: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-08 06:24:07,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: havoc main_~node2__m2~2#1; [2025-03-08 06:24:07,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2260: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-03-08 06:24:07,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2327: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-03-08 06:24:07,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-08 06:24:07,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L908: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-08 06:24:07,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1932: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-08 06:24:07,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1272: havoc main_~node3__m3~4#1; [2025-03-08 06:24:07,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1074: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-08 06:24:07,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1999: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-08 06:24:07,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:24:07,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L550: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:24:07,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:24:07,338 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc main_~node3__m3~5#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1378: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2072: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: havoc main_~node4__m4~3#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2403: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L223: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2106: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc main_~node4__m4~4#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: havoc main_~node3__m3~1#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182: havoc main_~check__tmp~9#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1116: havoc main_~node4__m4~5#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2173: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-08 06:24:07,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L390: 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-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1150: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2902: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1845: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L425: havoc main_~node3__m3~2#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2936: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3003: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2574: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2608: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1287: havoc main_~node4__m4~6#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1486: havoc main_~check__tmp~13#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1420: havoc main_~node4__m4~7#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L859: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L595: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1454: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1025: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1686: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-03-08 06:24:07,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257: havoc main_~node2__m2~3#1; [2025-03-08 06:24:07,397 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2025-03-08 06:24:07,398 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:24:07,414 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:24:07,414 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:24:07,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:24:07 BoogieIcfgContainer [2025-03-08 06:24:07,415 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:24:07,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:24:07,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:24:07,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:24:07,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:24:05" (1/3) ... [2025-03-08 06:24:07,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4304f8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:24:07, skipping insertion in model container [2025-03-08 06:24:07,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (2/3) ... [2025-03-08 06:24:07,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4304f8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:24:07, skipping insertion in model container [2025-03-08 06:24:07,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:24:07" (3/3) ... [2025-03-08 06:24:07,423 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:24:07,439 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:24:07,442 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 357 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-03-08 06:24:07,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:24:07,502 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;@66a3aab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:24:07,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-08 06:24:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 06:24:07,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:07,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:07,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:07,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1636711810, now seen corresponding path program 1 times [2025-03-08 06:24:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:07,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235818476] [2025-03-08 06:24:07,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:07,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:07,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 06:24:07,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 06:24:07,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:07,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:07,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:07,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235818476] [2025-03-08 06:24:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235818476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:07,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:07,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:24:07,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858241099] [2025-03-08 06:24:07,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:07,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:24:07,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:07,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:24:07,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:07,991 INFO L87 Difference]: Start difference. First operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:08,356 INFO L93 Difference]: Finished difference Result 569 states and 972 transitions. [2025-03-08 06:24:08,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:24:08,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-08 06:24:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:08,364 INFO L225 Difference]: With dead ends: 569 [2025-03-08 06:24:08,365 INFO L226 Difference]: Without dead ends: 314 [2025-03-08 06:24:08,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:24:08,372 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1498 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:08,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 403 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-08 06:24:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-08 06:24:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 303 states have (on average 1.2805280528052805) internal successors, (388), 313 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 388 transitions. [2025-03-08 06:24:08,419 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 388 transitions. Word has length 58 [2025-03-08 06:24:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:08,420 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 388 transitions. [2025-03-08 06:24:08,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 388 transitions. [2025-03-08 06:24:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 06:24:08,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:08,423 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] [2025-03-08 06:24:08,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:24:08,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:08,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1967361935, now seen corresponding path program 1 times [2025-03-08 06:24:08,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742946480] [2025-03-08 06:24:08,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:08,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 06:24:08,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 06:24:08,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:08,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742946480] [2025-03-08 06:24:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742946480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:08,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:24:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483036241] [2025-03-08 06:24:08,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:08,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:24:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:08,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:24:08,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:08,592 INFO L87 Difference]: Start difference. First operand 314 states and 388 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:08,811 INFO L93 Difference]: Finished difference Result 651 states and 837 transitions. [2025-03-08 06:24:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:24:08,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-08 06:24:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:08,814 INFO L225 Difference]: With dead ends: 651 [2025-03-08 06:24:08,816 INFO L226 Difference]: Without dead ends: 407 [2025-03-08 06:24:08,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:24:08,817 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1345 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:08,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 315 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:08,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-08 06:24:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 365. [2025-03-08 06:24:08,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 354 states have (on average 1.3644067796610169) internal successors, (483), 364 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 483 transitions. [2025-03-08 06:24:08,834 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 483 transitions. Word has length 59 [2025-03-08 06:24:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:08,834 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 483 transitions. [2025-03-08 06:24:08,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 483 transitions. [2025-03-08 06:24:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:24:08,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:08,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:08,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:24:08,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:08,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:08,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1090760522, now seen corresponding path program 1 times [2025-03-08 06:24:08,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:08,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7678053] [2025-03-08 06:24:08,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:08,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:24:08,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:24:08,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:08,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:08,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:08,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:08,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7678053] [2025-03-08 06:24:08,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7678053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:08,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:08,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:24:08,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085740224] [2025-03-08 06:24:08,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:08,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:24:08,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:08,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:24:08,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:08,998 INFO L87 Difference]: Start difference. First operand 365 states and 483 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:09,137 INFO L93 Difference]: Finished difference Result 660 states and 893 transitions. [2025-03-08 06:24:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:24:09,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-08 06:24:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:09,139 INFO L225 Difference]: With dead ends: 660 [2025-03-08 06:24:09,140 INFO L226 Difference]: Without dead ends: 346 [2025-03-08 06:24:09,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:24:09,141 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 914 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:09,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 200 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-08 06:24:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-08 06:24:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 335 states have (on average 1.373134328358209) internal successors, (460), 345 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 460 transitions. [2025-03-08 06:24:09,158 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 460 transitions. Word has length 60 [2025-03-08 06:24:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:09,159 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 460 transitions. [2025-03-08 06:24:09,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 460 transitions. [2025-03-08 06:24:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 06:24:09,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:09,162 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] [2025-03-08 06:24:09,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:24:09,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:09,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1934057823, now seen corresponding path program 1 times [2025-03-08 06:24:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:09,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260645474] [2025-03-08 06:24:09,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:09,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 06:24:09,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 06:24:09,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:09,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:09,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:09,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260645474] [2025-03-08 06:24:09,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260645474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:09,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:09,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:24:09,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333872207] [2025-03-08 06:24:09,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:09,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:24:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:09,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:24:09,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:09,297 INFO L87 Difference]: Start difference. First operand 346 states and 460 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:09,459 INFO L93 Difference]: Finished difference Result 641 states and 868 transitions. [2025-03-08 06:24:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:24:09,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-08 06:24:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:09,462 INFO L225 Difference]: With dead ends: 641 [2025-03-08 06:24:09,462 INFO L226 Difference]: Without dead ends: 338 [2025-03-08 06:24:09,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:24:09,463 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 871 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:09,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 196 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-08 06:24:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-03-08 06:24:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3730886850152906) internal successors, (449), 337 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 449 transitions. [2025-03-08 06:24:09,477 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 449 transitions. Word has length 61 [2025-03-08 06:24:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:09,477 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 449 transitions. [2025-03-08 06:24:09,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2025-03-08 06:24:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:24:09,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:09,479 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-08 06:24:09,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:24:09,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash -313296833, now seen corresponding path program 1 times [2025-03-08 06:24:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111281506] [2025-03-08 06:24:09,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:09,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:24:09,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:24:09,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:09,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:09,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111281506] [2025-03-08 06:24:09,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111281506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:09,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:09,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:24:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973614138] [2025-03-08 06:24:09,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:09,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:24:09,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:09,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:24:09,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:24:09,787 INFO L87 Difference]: Start difference. First operand 338 states and 449 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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-08 06:24:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:10,158 INFO L93 Difference]: Finished difference Result 688 states and 918 transitions. [2025-03-08 06:24:10,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:24:10,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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-08 06:24:10,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:10,160 INFO L225 Difference]: With dead ends: 688 [2025-03-08 06:24:10,160 INFO L226 Difference]: Without dead ends: 503 [2025-03-08 06:24:10,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:24:10,161 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1289 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:10,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 764 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-08 06:24:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 338. [2025-03-08 06:24:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3700305810397553) internal successors, (448), 337 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 448 transitions. [2025-03-08 06:24:10,170 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 448 transitions. Word has length 62 [2025-03-08 06:24:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:10,170 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 448 transitions. [2025-03-08 06:24:10,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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-08 06:24:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 448 transitions. [2025-03-08 06:24:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:24:10,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:10,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:10,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:24:10,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:10,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:10,172 INFO L85 PathProgramCache]: Analyzing trace with hash -733190650, now seen corresponding path program 1 times [2025-03-08 06:24:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:10,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791229562] [2025-03-08 06:24:10,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:10,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:10,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:24:10,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:24:10,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:10,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:10,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:10,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791229562] [2025-03-08 06:24:10,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791229562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:10,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:10,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:10,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107540482] [2025-03-08 06:24:10,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:10,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:10,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:10,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:10,471 INFO L87 Difference]: Start difference. First operand 338 states and 448 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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-08 06:24:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:10,946 INFO L93 Difference]: Finished difference Result 536 states and 734 transitions. [2025-03-08 06:24:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:24:10,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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-08 06:24:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:10,948 INFO L225 Difference]: With dead ends: 536 [2025-03-08 06:24:10,948 INFO L226 Difference]: Without dead ends: 396 [2025-03-08 06:24:10,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:24:10,949 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 968 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:10,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 1134 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:24:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-08 06:24:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 338. [2025-03-08 06:24:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 337 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 447 transitions. [2025-03-08 06:24:10,971 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 447 transitions. Word has length 62 [2025-03-08 06:24:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:10,971 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 447 transitions. [2025-03-08 06:24:10,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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-08 06:24:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 447 transitions. [2025-03-08 06:24:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:24:10,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:10,973 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-08 06:24:10,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:24:10,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:10,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash -506769422, now seen corresponding path program 1 times [2025-03-08 06:24:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:10,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693350644] [2025-03-08 06:24:10,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:10,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:24:11,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:24:11,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:11,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:11,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:11,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693350644] [2025-03-08 06:24:11,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693350644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:11,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:11,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:11,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483175667] [2025-03-08 06:24:11,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:11,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:11,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:11,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:11,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:11,181 INFO L87 Difference]: Start difference. First operand 338 states and 447 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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-08 06:24:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:11,573 INFO L93 Difference]: Finished difference Result 667 states and 911 transitions. [2025-03-08 06:24:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:24:11,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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-08 06:24:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:11,576 INFO L225 Difference]: With dead ends: 667 [2025-03-08 06:24:11,576 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 06:24:11,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:24:11,578 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 771 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:11,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 881 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 06:24:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 338. [2025-03-08 06:24:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.363914373088685) internal successors, (446), 337 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 446 transitions. [2025-03-08 06:24:11,589 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 446 transitions. Word has length 62 [2025-03-08 06:24:11,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:11,589 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 446 transitions. [2025-03-08 06:24:11,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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-08 06:24:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 446 transitions. [2025-03-08 06:24:11,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:24:11,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:11,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:11,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:24:11,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:11,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:11,590 INFO L85 PathProgramCache]: Analyzing trace with hash 990894559, now seen corresponding path program 1 times [2025-03-08 06:24:11,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:11,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131541083] [2025-03-08 06:24:11,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:11,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:11,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:24:11,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:24:11,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:11,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131541083] [2025-03-08 06:24:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131541083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:11,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:11,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:11,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144086100] [2025-03-08 06:24:11,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:11,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:11,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:11,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:11,781 INFO L87 Difference]: Start difference. First operand 338 states and 446 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:12,147 INFO L93 Difference]: Finished difference Result 566 states and 771 transitions. [2025-03-08 06:24:12,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:24:12,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:24:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:12,149 INFO L225 Difference]: With dead ends: 566 [2025-03-08 06:24:12,149 INFO L226 Difference]: Without dead ends: 396 [2025-03-08 06:24:12,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:24:12,150 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1360 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:12,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 777 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-08 06:24:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 338. [2025-03-08 06:24:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3577981651376148) internal successors, (444), 337 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 444 transitions. [2025-03-08 06:24:12,157 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 444 transitions. Word has length 64 [2025-03-08 06:24:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:12,157 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 444 transitions. [2025-03-08 06:24:12,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 444 transitions. [2025-03-08 06:24:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:24:12,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:12,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:12,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:24:12,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:12,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1621076992, now seen corresponding path program 1 times [2025-03-08 06:24:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:12,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879178572] [2025-03-08 06:24:12,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:12,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:24:12,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:24:12,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:12,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:12,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:12,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879178572] [2025-03-08 06:24:12,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879178572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:12,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:12,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:12,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766815708] [2025-03-08 06:24:12,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:12,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:12,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:12,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:12,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:12,375 INFO L87 Difference]: Start difference. First operand 338 states and 444 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:12,822 INFO L93 Difference]: Finished difference Result 566 states and 752 transitions. [2025-03-08 06:24:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:24:12,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:24:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:12,824 INFO L225 Difference]: With dead ends: 566 [2025-03-08 06:24:12,824 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 06:24:12,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:24:12,825 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1315 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:12,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 1220 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 06:24:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 338. [2025-03-08 06:24:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3516819571865444) internal successors, (442), 337 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2025-03-08 06:24:12,832 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 64 [2025-03-08 06:24:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:12,832 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2025-03-08 06:24:12,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2025-03-08 06:24:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:24:12,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:12,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:12,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:24:12,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:12,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:12,835 INFO L85 PathProgramCache]: Analyzing trace with hash -612939262, now seen corresponding path program 1 times [2025-03-08 06:24:12,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:12,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399416045] [2025-03-08 06:24:12,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:12,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:24:12,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:24:12,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:12,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:13,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:13,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399416045] [2025-03-08 06:24:13,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399416045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:13,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:13,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:13,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304948985] [2025-03-08 06:24:13,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:13,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:13,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:13,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:13,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:13,022 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:13,383 INFO L93 Difference]: Finished difference Result 534 states and 701 transitions. [2025-03-08 06:24:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:24:13,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:24:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:13,385 INFO L225 Difference]: With dead ends: 534 [2025-03-08 06:24:13,385 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 06:24:13,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:24:13,386 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 777 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:13,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 830 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 06:24:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-03-08 06:24:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.345565749235474) internal successors, (440), 337 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 440 transitions. [2025-03-08 06:24:13,392 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 440 transitions. Word has length 64 [2025-03-08 06:24:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:13,392 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 440 transitions. [2025-03-08 06:24:13,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 440 transitions. [2025-03-08 06:24:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:24:13,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:13,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:13,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:24:13,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:13,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2071658386, now seen corresponding path program 1 times [2025-03-08 06:24:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:13,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337688900] [2025-03-08 06:24:13,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:13,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:24:13,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:24:13,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:13,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:13,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:13,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337688900] [2025-03-08 06:24:13,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337688900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:13,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:13,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:13,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360107842] [2025-03-08 06:24:13,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:13,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:13,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:13,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:13,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:13,553 INFO L87 Difference]: Start difference. First operand 338 states and 440 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:13,970 INFO L93 Difference]: Finished difference Result 534 states and 699 transitions. [2025-03-08 06:24:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:24:13,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:24:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:13,972 INFO L225 Difference]: With dead ends: 534 [2025-03-08 06:24:13,972 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 06:24:13,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:24:13,973 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 775 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:13,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 815 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 06:24:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-03-08 06:24:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.342507645259939) internal successors, (439), 337 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 439 transitions. [2025-03-08 06:24:13,981 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 439 transitions. Word has length 64 [2025-03-08 06:24:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:13,981 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 439 transitions. [2025-03-08 06:24:13,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 439 transitions. [2025-03-08 06:24:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:24:13,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:13,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:13,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:24:13,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:13,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1845369059, now seen corresponding path program 1 times [2025-03-08 06:24:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474588953] [2025-03-08 06:24:13,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:13,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:13,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:24:14,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:24:14,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:14,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:14,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:14,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474588953] [2025-03-08 06:24:14,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474588953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:14,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222533769] [2025-03-08 06:24:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:14,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:14,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:14,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:14,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:14,160 INFO L87 Difference]: Start difference. First operand 338 states and 439 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:14,554 INFO L93 Difference]: Finished difference Result 637 states and 855 transitions. [2025-03-08 06:24:14,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:24:14,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:24:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:14,556 INFO L225 Difference]: With dead ends: 637 [2025-03-08 06:24:14,556 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 06:24:14,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:24:14,557 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1608 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:14,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 830 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 06:24:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-03-08 06:24:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 337 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 438 transitions. [2025-03-08 06:24:14,563 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 438 transitions. Word has length 64 [2025-03-08 06:24:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:14,563 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 438 transitions. [2025-03-08 06:24:14,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 438 transitions. [2025-03-08 06:24:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:24:14,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:14,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:14,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:24:14,564 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:14,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1450346746, now seen corresponding path program 1 times [2025-03-08 06:24:14,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:14,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76341580] [2025-03-08 06:24:14,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:14,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:24:14,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:24:14,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:14,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:14,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-08 06:24:14,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:14,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76341580] [2025-03-08 06:24:14,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76341580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:14,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:14,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:14,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336510123] [2025-03-08 06:24:14,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:14,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:14,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:14,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:14,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:14,709 INFO L87 Difference]: Start difference. First operand 338 states and 438 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:15,154 INFO L93 Difference]: Finished difference Result 672 states and 907 transitions. [2025-03-08 06:24:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:24:15,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:24:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:15,156 INFO L225 Difference]: With dead ends: 672 [2025-03-08 06:24:15,156 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 06:24:15,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:24:15,157 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 1127 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:15,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 1112 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 06:24:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 338. [2025-03-08 06:24:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3363914373088686) internal successors, (437), 337 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 437 transitions. [2025-03-08 06:24:15,165 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 437 transitions. Word has length 64 [2025-03-08 06:24:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:15,165 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 437 transitions. [2025-03-08 06:24:15,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 437 transitions. [2025-03-08 06:24:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:24:15,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:15,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:15,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:24:15,166 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:15,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:15,167 INFO L85 PathProgramCache]: Analyzing trace with hash 610604296, now seen corresponding path program 1 times [2025-03-08 06:24:15,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:15,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686373066] [2025-03-08 06:24:15,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:15,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:15,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:24:15,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:24:15,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:15,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:15,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:15,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686373066] [2025-03-08 06:24:15,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686373066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:15,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:15,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110234573] [2025-03-08 06:24:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:15,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:15,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:15,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:15,339 INFO L87 Difference]: Start difference. First operand 338 states and 437 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:15,710 INFO L93 Difference]: Finished difference Result 640 states and 856 transitions. [2025-03-08 06:24:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:24:15,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:24:15,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:15,712 INFO L225 Difference]: With dead ends: 640 [2025-03-08 06:24:15,712 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 06:24:15,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:24:15,713 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1540 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:15,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 882 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 06:24:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-03-08 06:24:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3333333333333333) internal successors, (436), 337 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 436 transitions. [2025-03-08 06:24:15,721 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 436 transitions. Word has length 64 [2025-03-08 06:24:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:15,721 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 436 transitions. [2025-03-08 06:24:15,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 436 transitions. [2025-03-08 06:24:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:24:15,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:15,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:15,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:24:15,722 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:15,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:15,723 INFO L85 PathProgramCache]: Analyzing trace with hash 59816032, now seen corresponding path program 1 times [2025-03-08 06:24:15,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:15,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173078199] [2025-03-08 06:24:15,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:15,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:15,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:24:15,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:24:15,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:15,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:16,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173078199] [2025-03-08 06:24:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173078199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:16,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:16,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:24:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111120721] [2025-03-08 06:24:16,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:16,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:24:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:16,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:24:16,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:24:16,210 INFO L87 Difference]: Start difference. First operand 338 states and 436 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:16,893 INFO L93 Difference]: Finished difference Result 828 states and 1090 transitions. [2025-03-08 06:24:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:24:16,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:24:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:16,896 INFO L225 Difference]: With dead ends: 828 [2025-03-08 06:24:16,896 INFO L226 Difference]: Without dead ends: 824 [2025-03-08 06:24:16,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:24:16,897 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1831 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1831 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:16,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1831 Valid, 1944 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-03-08 06:24:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 334. [2025-03-08 06:24:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.3333333333333333) internal successors, (432), 333 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 432 transitions. [2025-03-08 06:24:16,906 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 432 transitions. Word has length 66 [2025-03-08 06:24:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:16,906 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 432 transitions. [2025-03-08 06:24:16,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 432 transitions. [2025-03-08 06:24:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:24:16,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:16,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:16,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:24:16,908 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:16,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash 587583427, now seen corresponding path program 1 times [2025-03-08 06:24:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:16,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783423559] [2025-03-08 06:24:16,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:16,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:16,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:24:16,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:24:16,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:16,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:17,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783423559] [2025-03-08 06:24:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783423559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:17,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:17,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-08 06:24:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577525628] [2025-03-08 06:24:17,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:17,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 06:24:17,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:17,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 06:24:17,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:24:17,956 INFO L87 Difference]: Start difference. First operand 334 states and 432 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:20,372 INFO L93 Difference]: Finished difference Result 809 states and 1090 transitions. [2025-03-08 06:24:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 06:24:20,372 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:24:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:20,374 INFO L225 Difference]: With dead ends: 809 [2025-03-08 06:24:20,374 INFO L226 Difference]: Without dead ends: 702 [2025-03-08 06:24:20,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=372, Invalid=1884, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 06:24:20,375 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 1892 mSDsluCounter, 5898 mSDsCounter, 0 mSdLazyCounter, 3140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1892 SdHoareTripleChecker+Valid, 6348 SdHoareTripleChecker+Invalid, 3152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:20,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1892 Valid, 6348 Invalid, 3152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3140 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 06:24:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-08 06:24:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 333. [2025-03-08 06:24:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 323 states have (on average 1.3312693498452013) internal successors, (430), 332 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 430 transitions. [2025-03-08 06:24:20,381 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 430 transitions. Word has length 66 [2025-03-08 06:24:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:20,381 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 430 transitions. [2025-03-08 06:24:20,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 430 transitions. [2025-03-08 06:24:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:24:20,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:20,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:20,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:24:20,382 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:20,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:20,383 INFO L85 PathProgramCache]: Analyzing trace with hash 323524962, now seen corresponding path program 1 times [2025-03-08 06:24:20,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:20,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472483455] [2025-03-08 06:24:20,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:20,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:20,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:24:20,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:24:20,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:20,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472483455] [2025-03-08 06:24:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472483455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:21,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:21,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 06:24:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637879268] [2025-03-08 06:24:21,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:21,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 06:24:21,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:21,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 06:24:21,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:24:21,005 INFO L87 Difference]: Start difference. First operand 333 states and 430 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:22,599 INFO L93 Difference]: Finished difference Result 650 states and 857 transitions. [2025-03-08 06:24:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 06:24:22,599 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:24:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:22,601 INFO L225 Difference]: With dead ends: 650 [2025-03-08 06:24:22,601 INFO L226 Difference]: Without dead ends: 644 [2025-03-08 06:24:22,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=1163, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 06:24:22,602 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 1606 mSDsluCounter, 4623 mSDsCounter, 0 mSdLazyCounter, 2819 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 5074 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:22,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 5074 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2819 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:24:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-08 06:24:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 333. [2025-03-08 06:24:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 323 states have (on average 1.328173374613003) internal successors, (429), 332 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 429 transitions. [2025-03-08 06:24:22,610 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 429 transitions. Word has length 66 [2025-03-08 06:24:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:22,610 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 429 transitions. [2025-03-08 06:24:22,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 429 transitions. [2025-03-08 06:24:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:24:22,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:22,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:22,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:24:22,612 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:22,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1317814465, now seen corresponding path program 1 times [2025-03-08 06:24:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:22,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194236248] [2025-03-08 06:24:22,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:22,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:22,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:24:22,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:24:22,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:22,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:22,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:22,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194236248] [2025-03-08 06:24:22,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194236248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:22,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:22,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:24:22,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826989213] [2025-03-08 06:24:22,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:22,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:24:22,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:22,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:24:22,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:24:22,961 INFO L87 Difference]: Start difference. First operand 333 states and 429 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:23,434 INFO L93 Difference]: Finished difference Result 624 states and 845 transitions. [2025-03-08 06:24:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:24:23,435 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:24:23,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:23,436 INFO L225 Difference]: With dead ends: 624 [2025-03-08 06:24:23,436 INFO L226 Difference]: Without dead ends: 496 [2025-03-08 06:24:23,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:24:23,437 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 1227 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:23,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 2001 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-08 06:24:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 311. [2025-03-08 06:24:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 303 states have (on average 1.316831683168317) internal successors, (399), 310 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 399 transitions. [2025-03-08 06:24:23,442 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 399 transitions. Word has length 66 [2025-03-08 06:24:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:23,442 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 399 transitions. [2025-03-08 06:24:23,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 399 transitions. [2025-03-08 06:24:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:24:23,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:23,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:23,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:24:23,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:23,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:23,445 INFO L85 PathProgramCache]: Analyzing trace with hash -789563969, now seen corresponding path program 1 times [2025-03-08 06:24:23,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:23,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711941298] [2025-03-08 06:24:23,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:23,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:23,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:24:23,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:24:23,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:23,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:23,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711941298] [2025-03-08 06:24:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711941298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:23,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:23,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:24:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663817622] [2025-03-08 06:24:23,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:23,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:24:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:23,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:24:23,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:24:23,769 INFO L87 Difference]: Start difference. First operand 311 states and 399 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:24,215 INFO L93 Difference]: Finished difference Result 710 states and 973 transitions. [2025-03-08 06:24:24,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:24:24,215 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:24:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:24,216 INFO L225 Difference]: With dead ends: 710 [2025-03-08 06:24:24,217 INFO L226 Difference]: Without dead ends: 580 [2025-03-08 06:24:24,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:24:24,217 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1257 mSDsluCounter, 2435 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:24,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2788 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-08 06:24:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 287. [2025-03-08 06:24:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 280 states have (on average 1.3178571428571428) internal successors, (369), 286 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 369 transitions. [2025-03-08 06:24:24,222 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 369 transitions. Word has length 66 [2025-03-08 06:24:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:24,222 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 369 transitions. [2025-03-08 06:24:24,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 369 transitions. [2025-03-08 06:24:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:24:24,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:24,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:24,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:24:24,223 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:24,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash -935830778, now seen corresponding path program 1 times [2025-03-08 06:24:24,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:24,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786823436] [2025-03-08 06:24:24,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:24,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:24,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:24:24,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:24:24,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:24,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:24,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:24,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786823436] [2025-03-08 06:24:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786823436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:24,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:24,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:24:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766983995] [2025-03-08 06:24:24,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:24,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:24:24,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:24,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:24:24,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:24:24,598 INFO L87 Difference]: Start difference. First operand 287 states and 369 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:25,243 INFO L93 Difference]: Finished difference Result 843 states and 1144 transitions. [2025-03-08 06:24:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:24:25,244 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:24:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:25,245 INFO L225 Difference]: With dead ends: 843 [2025-03-08 06:24:25,245 INFO L226 Difference]: Without dead ends: 733 [2025-03-08 06:24:25,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:24:25,246 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 1583 mSDsluCounter, 1859 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:25,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 2139 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-08 06:24:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 283. [2025-03-08 06:24:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 277 states have (on average 1.3140794223826715) internal successors, (364), 282 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 364 transitions. [2025-03-08 06:24:25,251 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 364 transitions. Word has length 66 [2025-03-08 06:24:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:25,251 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 364 transitions. [2025-03-08 06:24:25,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 364 transitions. [2025-03-08 06:24:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:24:25,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:25,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] [2025-03-08 06:24:25,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:24:25,252 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:25,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:25,253 INFO L85 PathProgramCache]: Analyzing trace with hash -672121848, now seen corresponding path program 1 times [2025-03-08 06:24:25,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:25,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902868052] [2025-03-08 06:24:25,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:25,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:25,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:24:25,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:24:25,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:25,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:25,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:25,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902868052] [2025-03-08 06:24:25,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902868052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:25,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:25,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:24:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150860956] [2025-03-08 06:24:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:25,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:24:25,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:25,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:24:25,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:24:25,517 INFO L87 Difference]: Start difference. First operand 283 states and 364 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:25,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:25,807 INFO L93 Difference]: Finished difference Result 523 states and 710 transitions. [2025-03-08 06:24:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:24:25,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:24:25,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:25,808 INFO L225 Difference]: With dead ends: 523 [2025-03-08 06:24:25,808 INFO L226 Difference]: Without dead ends: 382 [2025-03-08 06:24:25,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:24:25,809 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 751 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:25,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1013 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-08 06:24:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 248. [2025-03-08 06:24:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 244 states have (on average 1.319672131147541) internal successors, (322), 247 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 322 transitions. [2025-03-08 06:24:25,813 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 322 transitions. Word has length 66 [2025-03-08 06:24:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:25,813 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 322 transitions. [2025-03-08 06:24:25,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 322 transitions. [2025-03-08 06:24:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:24:25,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:25,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:25,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:24:25,814 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:25,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:25,814 INFO L85 PathProgramCache]: Analyzing trace with hash 435214982, now seen corresponding path program 1 times [2025-03-08 06:24:25,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:25,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263964358] [2025-03-08 06:24:25,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:25,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:24:25,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:24:25,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:25,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:25,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:25,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263964358] [2025-03-08 06:24:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263964358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:25,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:25,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111892789] [2025-03-08 06:24:25,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:25,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:25,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:25,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:25,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:25,945 INFO L87 Difference]: Start difference. First operand 248 states and 322 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:26,210 INFO L93 Difference]: Finished difference Result 411 states and 544 transitions. [2025-03-08 06:24:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:24:26,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 06:24:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:26,212 INFO L225 Difference]: With dead ends: 411 [2025-03-08 06:24:26,212 INFO L226 Difference]: Without dead ends: 404 [2025-03-08 06:24:26,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:24:26,213 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 788 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:26,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 517 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-08 06:24:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 248. [2025-03-08 06:24:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 244 states have (on average 1.3155737704918034) internal successors, (321), 247 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 321 transitions. [2025-03-08 06:24:26,216 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 321 transitions. Word has length 67 [2025-03-08 06:24:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:26,217 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 321 transitions. [2025-03-08 06:24:26,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 321 transitions. [2025-03-08 06:24:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:24:26,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:26,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:26,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:24:26,217 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:26,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:26,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1095584606, now seen corresponding path program 1 times [2025-03-08 06:24:26,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:26,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26357247] [2025-03-08 06:24:26,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:26,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:26,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:24:26,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:24:26,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:26,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:26,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:26,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26357247] [2025-03-08 06:24:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26357247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:26,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:26,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:24:26,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74862335] [2025-03-08 06:24:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:26,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:24:26,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:26,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:24:26,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:24:26,542 INFO L87 Difference]: Start difference. First operand 248 states and 321 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:26,852 INFO L93 Difference]: Finished difference Result 268 states and 340 transitions. [2025-03-08 06:24:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:24:26,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 06:24:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:26,853 INFO L225 Difference]: With dead ends: 268 [2025-03-08 06:24:26,853 INFO L226 Difference]: Without dead ends: 240 [2025-03-08 06:24:26,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:24:26,853 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 279 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:26,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1411 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-08 06:24:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-03-08 06:24:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 239 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 310 transitions. [2025-03-08 06:24:26,856 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 310 transitions. Word has length 67 [2025-03-08 06:24:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:26,856 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 310 transitions. [2025-03-08 06:24:26,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 310 transitions. [2025-03-08 06:24:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:24:26,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:26,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:26,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:24:26,857 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:26,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:26,857 INFO L85 PathProgramCache]: Analyzing trace with hash 354249932, now seen corresponding path program 1 times [2025-03-08 06:24:26,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:26,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637075695] [2025-03-08 06:24:26,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:26,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:24:26,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:24:26,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:26,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:26,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:26,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637075695] [2025-03-08 06:24:26,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637075695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:26,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:26,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:26,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583001554] [2025-03-08 06:24:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:26,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:26,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:26,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:26,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:26,979 INFO L87 Difference]: Start difference. First operand 240 states and 310 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:27,201 INFO L93 Difference]: Finished difference Result 530 states and 722 transitions. [2025-03-08 06:24:27,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:24:27,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 06:24:27,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:27,203 INFO L225 Difference]: With dead ends: 530 [2025-03-08 06:24:27,203 INFO L226 Difference]: Without dead ends: 394 [2025-03-08 06:24:27,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:24:27,203 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 690 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:27,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 687 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-08 06:24:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 240. [2025-03-08 06:24:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 236 states have (on average 1.305084745762712) internal successors, (308), 239 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 308 transitions. [2025-03-08 06:24:27,207 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 308 transitions. Word has length 67 [2025-03-08 06:24:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:27,207 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 308 transitions. [2025-03-08 06:24:27,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 308 transitions. [2025-03-08 06:24:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:24:27,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:27,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:27,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:24:27,208 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:27,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:27,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1163456559, now seen corresponding path program 1 times [2025-03-08 06:24:27,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:27,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420418366] [2025-03-08 06:24:27,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:27,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:27,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:24:27,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:24:27,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:27,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:27,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:27,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420418366] [2025-03-08 06:24:27,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420418366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:27,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:27,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 06:24:27,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729487795] [2025-03-08 06:24:27,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:27,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 06:24:27,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:27,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 06:24:27,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:24:27,730 INFO L87 Difference]: Start difference. First operand 240 states and 308 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:28,211 INFO L93 Difference]: Finished difference Result 346 states and 468 transitions. [2025-03-08 06:24:28,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:24:28,211 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 06:24:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:28,211 INFO L225 Difference]: With dead ends: 346 [2025-03-08 06:24:28,212 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 06:24:28,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:24:28,212 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 218 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:28,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1334 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 06:24:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-08 06:24:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 209 states have (on average 1.3157894736842106) internal successors, (275), 210 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 275 transitions. [2025-03-08 06:24:28,214 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 275 transitions. Word has length 67 [2025-03-08 06:24:28,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:28,215 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 275 transitions. [2025-03-08 06:24:28,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 275 transitions. [2025-03-08 06:24:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:24:28,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:28,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:28,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:24:28,220 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:28,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash 934143180, now seen corresponding path program 1 times [2025-03-08 06:24:28,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:28,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088458460] [2025-03-08 06:24:28,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:28,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:28,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:24:28,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:24:28,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:28,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:28,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:28,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088458460] [2025-03-08 06:24:28,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088458460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:28,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:28,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:24:28,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735313484] [2025-03-08 06:24:28,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:28,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:24:28,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:28,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:24:28,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:24:28,535 INFO L87 Difference]: Start difference. First operand 211 states and 275 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:28,993 INFO L93 Difference]: Finished difference Result 583 states and 815 transitions. [2025-03-08 06:24:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:24:28,994 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 06:24:28,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:28,995 INFO L225 Difference]: With dead ends: 583 [2025-03-08 06:24:28,995 INFO L226 Difference]: Without dead ends: 577 [2025-03-08 06:24:28,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:24:28,996 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1005 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:28,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1355 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-08 06:24:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 205. [2025-03-08 06:24:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.3137254901960784) internal successors, (268), 204 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 268 transitions. [2025-03-08 06:24:28,999 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 268 transitions. Word has length 69 [2025-03-08 06:24:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:29,000 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 268 transitions. [2025-03-08 06:24:29,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 268 transitions. [2025-03-08 06:24:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:24:29,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:29,000 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-08 06:24:29,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:24:29,001 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:29,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:29,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1779431181, now seen corresponding path program 1 times [2025-03-08 06:24:29,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:29,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686575917] [2025-03-08 06:24:29,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:29,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:29,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:24:29,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:24:29,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:29,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:29,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:29,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686575917] [2025-03-08 06:24:29,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686575917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:29,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:29,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:29,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945722823] [2025-03-08 06:24:29,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:29,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:29,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:29,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:29,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:29,061 INFO L87 Difference]: Start difference. First operand 205 states and 268 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-08 06:24:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:29,143 INFO L93 Difference]: Finished difference Result 1053 states and 1548 transitions. [2025-03-08 06:24:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:24:29,143 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-08 06:24:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:29,145 INFO L225 Difference]: With dead ends: 1053 [2025-03-08 06:24:29,145 INFO L226 Difference]: Without dead ends: 947 [2025-03-08 06:24:29,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:24:29,146 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 831 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:29,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1028 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-08 06:24:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 309. [2025-03-08 06:24:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.3733766233766234) internal successors, (423), 308 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 423 transitions. [2025-03-08 06:24:29,151 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 423 transitions. Word has length 92 [2025-03-08 06:24:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:29,151 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 423 transitions. [2025-03-08 06:24:29,151 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-08 06:24:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 423 transitions. [2025-03-08 06:24:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:24:29,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:29,152 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-08 06:24:29,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:24:29,152 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:29,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1762348105, now seen corresponding path program 1 times [2025-03-08 06:24:29,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:29,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971487598] [2025-03-08 06:24:29,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:29,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:29,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:24:29,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:24:29,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:29,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:29,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:29,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971487598] [2025-03-08 06:24:29,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971487598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:29,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:29,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:29,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621928704] [2025-03-08 06:24:29,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:29,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:29,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:29,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:29,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:29,222 INFO L87 Difference]: Start difference. First operand 309 states and 423 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-08 06:24:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:29,280 INFO L93 Difference]: Finished difference Result 1255 states and 1839 transitions. [2025-03-08 06:24:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:29,280 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-08 06:24:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:29,282 INFO L225 Difference]: With dead ends: 1255 [2025-03-08 06:24:29,282 INFO L226 Difference]: Without dead ends: 1045 [2025-03-08 06:24:29,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:29,283 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 579 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:29,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 736 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-03-08 06:24:29,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 517. [2025-03-08 06:24:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.4244186046511629) internal successors, (735), 516 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 735 transitions. [2025-03-08 06:24:29,289 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 735 transitions. Word has length 94 [2025-03-08 06:24:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:29,290 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 735 transitions. [2025-03-08 06:24:29,290 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-08 06:24:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 735 transitions. [2025-03-08 06:24:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:24:29,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:29,291 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-08 06:24:29,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:24:29,291 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:29,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:29,291 INFO L85 PathProgramCache]: Analyzing trace with hash -609122327, now seen corresponding path program 1 times [2025-03-08 06:24:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:29,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839597992] [2025-03-08 06:24:29,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:29,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:24:29,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:24:29,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:29,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839597992] [2025-03-08 06:24:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839597992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:29,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:29,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:29,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243396325] [2025-03-08 06:24:29,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:29,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:29,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:29,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:29,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:29,355 INFO L87 Difference]: Start difference. First operand 517 states and 735 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-08 06:24:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:29,406 INFO L93 Difference]: Finished difference Result 1463 states and 2151 transitions. [2025-03-08 06:24:29,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:29,406 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-08 06:24:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:29,409 INFO L225 Difference]: With dead ends: 1463 [2025-03-08 06:24:29,409 INFO L226 Difference]: Without dead ends: 1253 [2025-03-08 06:24:29,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:29,409 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 620 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:29,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 683 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-03-08 06:24:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 829. [2025-03-08 06:24:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.4516908212560387) internal successors, (1202), 828 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1202 transitions. [2025-03-08 06:24:29,418 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1202 transitions. Word has length 94 [2025-03-08 06:24:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:29,418 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1202 transitions. [2025-03-08 06:24:29,418 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-08 06:24:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1202 transitions. [2025-03-08 06:24:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:24:29,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:29,419 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-08 06:24:29,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:24:29,420 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:29,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1560712073, now seen corresponding path program 1 times [2025-03-08 06:24:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:29,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176652464] [2025-03-08 06:24:29,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:29,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:29,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:24:29,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:24:29,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:29,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:29,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:29,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176652464] [2025-03-08 06:24:29,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176652464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:29,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:29,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:29,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312508935] [2025-03-08 06:24:29,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:29,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:29,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:29,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:29,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:29,491 INFO L87 Difference]: Start difference. First operand 829 states and 1202 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-08 06:24:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:29,542 INFO L93 Difference]: Finished difference Result 1671 states and 2463 transitions. [2025-03-08 06:24:29,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:29,542 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-08 06:24:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:29,545 INFO L225 Difference]: With dead ends: 1671 [2025-03-08 06:24:29,545 INFO L226 Difference]: Without dead ends: 1461 [2025-03-08 06:24:29,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:29,546 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 595 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:29,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 736 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2025-03-08 06:24:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1037. [2025-03-08 06:24:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1036 states have (on average 1.4613899613899615) internal successors, (1514), 1036 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1514 transitions. [2025-03-08 06:24:29,557 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1514 transitions. Word has length 94 [2025-03-08 06:24:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:29,557 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1514 transitions. [2025-03-08 06:24:29,558 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-08 06:24:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1514 transitions. [2025-03-08 06:24:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:24:29,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:29,559 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-08 06:24:29,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:24:29,559 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:29,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1840747204, now seen corresponding path program 1 times [2025-03-08 06:24:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880241370] [2025-03-08 06:24:29,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:29,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:24:29,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:24:29,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:29,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:29,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880241370] [2025-03-08 06:24:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880241370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:29,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065267469] [2025-03-08 06:24:29,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:29,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:29,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:29,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:29,607 INFO L87 Difference]: Start difference. First operand 1037 states and 1514 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:29,629 INFO L93 Difference]: Finished difference Result 2797 states and 4122 transitions. [2025-03-08 06:24:29,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:29,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:24:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:29,633 INFO L225 Difference]: With dead ends: 2797 [2025-03-08 06:24:29,633 INFO L226 Difference]: Without dead ends: 1859 [2025-03-08 06:24:29,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:29,635 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 90 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:29,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 254 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-03-08 06:24:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1839. [2025-03-08 06:24:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1838 states have (on average 1.442328618063112) internal successors, (2651), 1838 states have internal predecessors, (2651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2651 transitions. [2025-03-08 06:24:29,657 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2651 transitions. Word has length 94 [2025-03-08 06:24:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:29,657 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 2651 transitions. [2025-03-08 06:24:29,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2651 transitions. [2025-03-08 06:24:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:24:29,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:29,659 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-08 06:24:29,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:24:29,659 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:29,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1876764523, now seen corresponding path program 1 times [2025-03-08 06:24:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:29,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360014716] [2025-03-08 06:24:29,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:29,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:24:29,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:24:29,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:29,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:29,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360014716] [2025-03-08 06:24:29,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360014716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:29,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14608469] [2025-03-08 06:24:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:29,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:29,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:29,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:29,767 INFO L87 Difference]: Start difference. First operand 1839 states and 2651 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-08 06:24:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:29,821 INFO L93 Difference]: Finished difference Result 3581 states and 5195 transitions. [2025-03-08 06:24:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:29,821 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-08 06:24:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:29,824 INFO L225 Difference]: With dead ends: 3581 [2025-03-08 06:24:29,824 INFO L226 Difference]: Without dead ends: 1841 [2025-03-08 06:24:29,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:24:29,826 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 140 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:29,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 388 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:29,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2025-03-08 06:24:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1839. [2025-03-08 06:24:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1838 states have (on average 1.4368879216539716) internal successors, (2641), 1838 states have internal predecessors, (2641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2641 transitions. [2025-03-08 06:24:29,842 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2641 transitions. Word has length 94 [2025-03-08 06:24:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:29,842 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 2641 transitions. [2025-03-08 06:24:29,842 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-08 06:24:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2641 transitions. [2025-03-08 06:24:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:24:29,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:29,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:29,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:24:29,843 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1920257440, now seen corresponding path program 1 times [2025-03-08 06:24:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:29,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658591351] [2025-03-08 06:24:29,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:29,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:24:29,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:24:29,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:29,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:29,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658591351] [2025-03-08 06:24:29,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658591351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:29,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:29,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:29,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159268424] [2025-03-08 06:24:29,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:29,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:29,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:29,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:29,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:29,896 INFO L87 Difference]: Start difference. First operand 1839 states and 2641 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:29,916 INFO L93 Difference]: Finished difference Result 5175 states and 7455 transitions. [2025-03-08 06:24:29,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:29,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:24:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:29,924 INFO L225 Difference]: With dead ends: 5175 [2025-03-08 06:24:29,924 INFO L226 Difference]: Without dead ends: 3435 [2025-03-08 06:24:29,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:29,925 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 73 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 335 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-08 06:24:29,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2025-03-08 06:24:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3289. [2025-03-08 06:24:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 3288 states have (on average 1.4309610705596107) internal successors, (4705), 3288 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 4705 transitions. [2025-03-08 06:24:29,964 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 4705 transitions. Word has length 95 [2025-03-08 06:24:29,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:29,965 INFO L471 AbstractCegarLoop]: Abstraction has 3289 states and 4705 transitions. [2025-03-08 06:24:29,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 4705 transitions. [2025-03-08 06:24:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:24:29,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:29,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:29,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:24:29,966 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:29,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:29,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1341386876, now seen corresponding path program 1 times [2025-03-08 06:24:29,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:29,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063596380] [2025-03-08 06:24:29,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:29,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:29,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:24:29,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:24:29,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:29,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:30,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:30,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063596380] [2025-03-08 06:24:30,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063596380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:30,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:30,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:30,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258951655] [2025-03-08 06:24:30,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:30,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:30,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:30,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:30,050 INFO L87 Difference]: Start difference. First operand 3289 states and 4705 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:30,079 INFO L93 Difference]: Finished difference Result 9381 states and 13395 transitions. [2025-03-08 06:24:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:24:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:30,102 INFO L225 Difference]: With dead ends: 9381 [2025-03-08 06:24:30,102 INFO L226 Difference]: Without dead ends: 6191 [2025-03-08 06:24:30,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:30,108 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 66 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 335 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-08 06:24:30,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2025-03-08 06:24:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 5901. [2025-03-08 06:24:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5901 states, 5900 states have (on average 1.4177966101694914) internal successors, (8365), 5900 states have internal predecessors, (8365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5901 states to 5901 states and 8365 transitions. [2025-03-08 06:24:30,166 INFO L78 Accepts]: Start accepts. Automaton has 5901 states and 8365 transitions. Word has length 96 [2025-03-08 06:24:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:30,166 INFO L471 AbstractCegarLoop]: Abstraction has 5901 states and 8365 transitions. [2025-03-08 06:24:30,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 5901 states and 8365 transitions. [2025-03-08 06:24:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:24:30,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:30,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:30,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:24:30,167 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:30,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1272713517, now seen corresponding path program 1 times [2025-03-08 06:24:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:30,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991629723] [2025-03-08 06:24:30,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:30,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:30,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:24:30,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:24:30,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:30,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:30,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991629723] [2025-03-08 06:24:30,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991629723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:30,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:30,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632425543] [2025-03-08 06:24:30,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:30,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:30,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:30,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:30,223 INFO L87 Difference]: Start difference. First operand 5901 states and 8365 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:30,260 INFO L93 Difference]: Finished difference Result 16929 states and 23871 transitions. [2025-03-08 06:24:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:30,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:24:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:30,279 INFO L225 Difference]: With dead ends: 16929 [2025-03-08 06:24:30,279 INFO L226 Difference]: Without dead ends: 11127 [2025-03-08 06:24:30,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:30,286 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 56 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:30,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 335 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:30,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11127 states. [2025-03-08 06:24:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11127 to 10549. [2025-03-08 06:24:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10549 states, 10548 states have (on average 1.3982745544178992) internal successors, (14749), 10548 states have internal predecessors, (14749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10549 states to 10549 states and 14749 transitions. [2025-03-08 06:24:30,393 INFO L78 Accepts]: Start accepts. Automaton has 10549 states and 14749 transitions. Word has length 97 [2025-03-08 06:24:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:30,393 INFO L471 AbstractCegarLoop]: Abstraction has 10549 states and 14749 transitions. [2025-03-08 06:24:30,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 10549 states and 14749 transitions. [2025-03-08 06:24:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:24:30,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:30,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:30,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:24:30,394 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:30,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 870655439, now seen corresponding path program 1 times [2025-03-08 06:24:30,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:30,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520854623] [2025-03-08 06:24:30,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:30,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:24:30,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:24:30,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:30,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:30,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:30,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520854623] [2025-03-08 06:24:30,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520854623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:30,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:30,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:30,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915878743] [2025-03-08 06:24:30,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:30,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:30,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:30,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:30,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:30,523 INFO L87 Difference]: Start difference. First operand 10549 states and 14749 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:30,553 INFO L93 Difference]: Finished difference Result 10935 states and 15262 transitions. [2025-03-08 06:24:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:30,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:24:30,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:30,569 INFO L225 Difference]: With dead ends: 10935 [2025-03-08 06:24:30,570 INFO L226 Difference]: Without dead ends: 10933 [2025-03-08 06:24:30,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:30,573 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:30,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 769 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10933 states. [2025-03-08 06:24:30,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10933 to 10933. [2025-03-08 06:24:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10933 states, 10932 states have (on average 1.3769667032564947) internal successors, (15053), 10932 states have internal predecessors, (15053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10933 states to 10933 states and 15053 transitions. [2025-03-08 06:24:30,684 INFO L78 Accepts]: Start accepts. Automaton has 10933 states and 15053 transitions. Word has length 98 [2025-03-08 06:24:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:30,685 INFO L471 AbstractCegarLoop]: Abstraction has 10933 states and 15053 transitions. [2025-03-08 06:24:30,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 10933 states and 15053 transitions. [2025-03-08 06:24:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:24:30,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:30,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:30,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:24:30,685 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:30,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:30,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1942643465, now seen corresponding path program 1 times [2025-03-08 06:24:30,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:30,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35793162] [2025-03-08 06:24:30,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:30,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:24:30,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:24:30,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:30,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:30,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35793162] [2025-03-08 06:24:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35793162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:30,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:30,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:30,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967044580] [2025-03-08 06:24:30,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:30,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:30,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:30,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:30,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:30,759 INFO L87 Difference]: Start difference. First operand 10933 states and 15053 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:30,869 INFO L93 Difference]: Finished difference Result 20607 states and 28498 transitions. [2025-03-08 06:24:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:30,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:24:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:30,901 INFO L225 Difference]: With dead ends: 20607 [2025-03-08 06:24:30,901 INFO L226 Difference]: Without dead ends: 18189 [2025-03-08 06:24:30,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:30,908 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 590 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:30,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 811 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18189 states. [2025-03-08 06:24:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18189 to 13349. [2025-03-08 06:24:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13349 states, 13348 states have (on average 1.3770602337428828) internal successors, (18381), 13348 states have internal predecessors, (18381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13349 states to 13349 states and 18381 transitions. [2025-03-08 06:24:31,146 INFO L78 Accepts]: Start accepts. Automaton has 13349 states and 18381 transitions. Word has length 98 [2025-03-08 06:24:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:31,147 INFO L471 AbstractCegarLoop]: Abstraction has 13349 states and 18381 transitions. [2025-03-08 06:24:31,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 13349 states and 18381 transitions. [2025-03-08 06:24:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:24:31,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:31,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:31,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:24:31,150 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:31,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:31,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1536114337, now seen corresponding path program 1 times [2025-03-08 06:24:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:31,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219878249] [2025-03-08 06:24:31,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:31,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:31,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:24:31,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:24:31,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:31,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:31,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:31,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219878249] [2025-03-08 06:24:31,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219878249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:31,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:31,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430563792] [2025-03-08 06:24:31,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:31,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:31,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:31,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:31,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:31,271 INFO L87 Difference]: Start difference. First operand 13349 states and 18381 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:31,346 INFO L93 Difference]: Finished difference Result 34745 states and 47783 transitions. [2025-03-08 06:24:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-08 06:24:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:31,386 INFO L225 Difference]: With dead ends: 34745 [2025-03-08 06:24:31,386 INFO L226 Difference]: Without dead ends: 21495 [2025-03-08 06:24:31,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:31,401 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 77 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 338 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-08 06:24:31,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 338 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:31,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21495 states. [2025-03-08 06:24:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21495 to 20085. [2025-03-08 06:24:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20085 states, 20084 states have (on average 1.3553574985062737) internal successors, (27221), 20084 states have internal predecessors, (27221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 27221 transitions. [2025-03-08 06:24:31,659 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 27221 transitions. Word has length 99 [2025-03-08 06:24:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:31,659 INFO L471 AbstractCegarLoop]: Abstraction has 20085 states and 27221 transitions. [2025-03-08 06:24:31,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 27221 transitions. [2025-03-08 06:24:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:24:31,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:31,662 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:31,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:24:31,662 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:31,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:31,663 INFO L85 PathProgramCache]: Analyzing trace with hash 343834162, now seen corresponding path program 1 times [2025-03-08 06:24:31,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:31,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221629707] [2025-03-08 06:24:31,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:31,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:31,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:24:31,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:24:31,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:31,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:31,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:31,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221629707] [2025-03-08 06:24:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221629707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:31,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:31,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:31,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087204825] [2025-03-08 06:24:31,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:31,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:31,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:31,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:31,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:31,726 INFO L87 Difference]: Start difference. First operand 20085 states and 27221 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:31,871 INFO L93 Difference]: Finished difference Result 40073 states and 54335 transitions. [2025-03-08 06:24:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:31,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-08 06:24:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:31,893 INFO L225 Difference]: With dead ends: 40073 [2025-03-08 06:24:31,893 INFO L226 Difference]: Without dead ends: 20087 [2025-03-08 06:24:31,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:31,908 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 69 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:31,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 311 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20087 states. [2025-03-08 06:24:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20087 to 20085. [2025-03-08 06:24:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20085 states, 20084 states have (on average 1.3378311093407689) internal successors, (26869), 20084 states have internal predecessors, (26869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 26869 transitions. [2025-03-08 06:24:32,136 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 26869 transitions. Word has length 125 [2025-03-08 06:24:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:32,136 INFO L471 AbstractCegarLoop]: Abstraction has 20085 states and 26869 transitions. [2025-03-08 06:24:32,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 26869 transitions. [2025-03-08 06:24:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:24:32,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:32,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:32,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:24:32,140 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:32,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash 781934089, now seen corresponding path program 1 times [2025-03-08 06:24:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:32,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885716929] [2025-03-08 06:24:32,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:32,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:24:32,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:24:32,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:32,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:32,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:32,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885716929] [2025-03-08 06:24:32,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885716929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:32,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954063893] [2025-03-08 06:24:32,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:32,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:32,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:32,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:24:32,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:24:32,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:24:32,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:24:32,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:32,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:32,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 06:24:32,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:33,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:24:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:34,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954063893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:24:34,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:24:34,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-03-08 06:24:34,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338577430] [2025-03-08 06:24:34,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:24:34,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 06:24:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:34,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 06:24:34,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:24:34,710 INFO L87 Difference]: Start difference. First operand 20085 states and 26869 transitions. Second operand has 28 states, 28 states have (on average 10.571428571428571) internal successors, (296), 27 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:37,714 INFO L93 Difference]: Finished difference Result 163976 states and 217807 transitions. [2025-03-08 06:24:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-03-08 06:24:37,715 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.571428571428571) internal successors, (296), 27 states have internal predecessors, (296), 0 states have call successors, (0), 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 125 [2025-03-08 06:24:37,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:37,951 INFO L225 Difference]: With dead ends: 163976 [2025-03-08 06:24:37,952 INFO L226 Difference]: Without dead ends: 143990 [2025-03-08 06:24:37,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4655 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2236, Invalid=13016, Unknown=0, NotChecked=0, Total=15252 [2025-03-08 06:24:37,984 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 3484 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3484 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:37,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3484 Valid, 2344 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:24:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143990 states. [2025-03-08 06:24:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143990 to 72622. [2025-03-08 06:24:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72622 states, 72621 states have (on average 1.3245755360019829) internal successors, (96192), 72621 states have internal predecessors, (96192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72622 states to 72622 states and 96192 transitions. [2025-03-08 06:24:39,104 INFO L78 Accepts]: Start accepts. Automaton has 72622 states and 96192 transitions. Word has length 125 [2025-03-08 06:24:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:39,104 INFO L471 AbstractCegarLoop]: Abstraction has 72622 states and 96192 transitions. [2025-03-08 06:24:39,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.571428571428571) internal successors, (296), 27 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 72622 states and 96192 transitions. [2025-03-08 06:24:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 06:24:39,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:39,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:39,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:24:39,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-08 06:24:39,310 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:39,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash -831569981, now seen corresponding path program 1 times [2025-03-08 06:24:39,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:39,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765450290] [2025-03-08 06:24:39,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:39,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:39,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:24:39,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:24:39,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:39,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:39,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765450290] [2025-03-08 06:24:39,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765450290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251615379] [2025-03-08 06:24:39,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:39,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:39,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:39,926 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:24:39,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:24:40,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:24:40,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:24:40,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:40,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:40,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 06:24:40,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:40,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:24:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:40,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251615379] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:24:40,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:24:40,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 30 [2025-03-08 06:24:40,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930642089] [2025-03-08 06:24:40,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:24:40,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 06:24:40,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:40,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 06:24:40,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:24:40,943 INFO L87 Difference]: Start difference. First operand 72622 states and 96192 transitions. Second operand has 30 states, 30 states have (on average 11.033333333333333) internal successors, (331), 30 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:43,049 INFO L93 Difference]: Finished difference Result 206512 states and 273475 transitions. [2025-03-08 06:24:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-08 06:24:43,050 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.033333333333333) internal successors, (331), 30 states have internal predecessors, (331), 0 states have call successors, (0), 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 126 [2025-03-08 06:24:43,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:43,205 INFO L225 Difference]: With dead ends: 206512 [2025-03-08 06:24:43,205 INFO L226 Difference]: Without dead ends: 133996 [2025-03-08 06:24:43,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=694, Invalid=5626, Unknown=0, NotChecked=0, Total=6320 [2025-03-08 06:24:43,266 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1087 mSDsluCounter, 7222 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 7571 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:43,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 7571 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:24:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133996 states. [2025-03-08 06:24:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133996 to 98666. [2025-03-08 06:24:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98666 states, 98665 states have (on average 1.3248973800233113) internal successors, (130721), 98665 states have internal predecessors, (130721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98666 states to 98666 states and 130721 transitions. [2025-03-08 06:24:44,518 INFO L78 Accepts]: Start accepts. Automaton has 98666 states and 130721 transitions. Word has length 126 [2025-03-08 06:24:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:44,518 INFO L471 AbstractCegarLoop]: Abstraction has 98666 states and 130721 transitions. [2025-03-08 06:24:44,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.033333333333333) internal successors, (331), 30 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 98666 states and 130721 transitions. [2025-03-08 06:24:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 06:24:44,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:44,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:44,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:24:44,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-03-08 06:24:44,726 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:44,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:44,727 INFO L85 PathProgramCache]: Analyzing trace with hash 486104220, now seen corresponding path program 1 times [2025-03-08 06:24:44,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:44,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449163200] [2025-03-08 06:24:44,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:44,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:44,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:24:44,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:24:44,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:44,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:24:44,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:44,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449163200] [2025-03-08 06:24:44,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449163200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:44,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:44,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:24:44,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174700259] [2025-03-08 06:24:44,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:44,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:24:44,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:44,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:24:44,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:24:44,775 INFO L87 Difference]: Start difference. First operand 98666 states and 130721 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:45,446 INFO L93 Difference]: Finished difference Result 200634 states and 265451 transitions. [2025-03-08 06:24:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:24:45,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 126 [2025-03-08 06:24:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:45,626 INFO L225 Difference]: With dead ends: 200634 [2025-03-08 06:24:45,627 INFO L226 Difference]: Without dead ends: 131024 [2025-03-08 06:24:45,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:45,680 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 105 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:45,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 291 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131024 states. [2025-03-08 06:24:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131024 to 98314. [2025-03-08 06:24:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98314 states, 98313 states have (on average 1.3224802416770927) internal successors, (130017), 98313 states have internal predecessors, (130017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98314 states to 98314 states and 130017 transitions. [2025-03-08 06:24:47,156 INFO L78 Accepts]: Start accepts. Automaton has 98314 states and 130017 transitions. Word has length 126 [2025-03-08 06:24:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:47,156 INFO L471 AbstractCegarLoop]: Abstraction has 98314 states and 130017 transitions. [2025-03-08 06:24:47,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 98314 states and 130017 transitions. [2025-03-08 06:24:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 06:24:47,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:47,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:47,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 06:24:47,163 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:24:47,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1083307491, now seen corresponding path program 1 times [2025-03-08 06:24:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:47,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437944263] [2025-03-08 06:24:47,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:47,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:47,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:24:47,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:24:47,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:47,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:47,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:47,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437944263] [2025-03-08 06:24:47,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437944263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:47,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793723732] [2025-03-08 06:24:47,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:47,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:47,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:47,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:24:47,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:24:47,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:24:47,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:24:47,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:47,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:47,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 06:24:47,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:48,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:24:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:48,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793723732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:24:48,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:24:48,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2025-03-08 06:24:48,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387357195] [2025-03-08 06:24:48,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:24:48,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 06:24:48,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:48,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 06:24:48,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:24:48,985 INFO L87 Difference]: Start difference. First operand 98314 states and 130017 transitions. Second operand has 26 states, 26 states have (on average 12.807692307692308) internal successors, (333), 26 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:55,993 INFO L93 Difference]: Finished difference Result 550861 states and 728004 transitions. [2025-03-08 06:24:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2025-03-08 06:24:55,993 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 12.807692307692308) internal successors, (333), 26 states have internal predecessors, (333), 0 states have call successors, (0), 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 126 [2025-03-08 06:24:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:56,631 INFO L225 Difference]: With dead ends: 550861 [2025-03-08 06:24:56,631 INFO L226 Difference]: Without dead ends: 452679 [2025-03-08 06:24:56,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6603 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2950, Invalid=17642, Unknown=0, NotChecked=0, Total=20592 [2025-03-08 06:24:56,773 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 3147 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3147 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:56,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3147 Valid, 2409 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:24:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452679 states. [2025-03-08 06:25:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452679 to 291031. [2025-03-08 06:25:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291031 states, 291030 states have (on average 1.3187162835446518) internal successors, (383786), 291030 states have internal predecessors, (383786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291031 states to 291031 states and 383786 transitions. [2025-03-08 06:25:01,826 INFO L78 Accepts]: Start accepts. Automaton has 291031 states and 383786 transitions. Word has length 126 [2025-03-08 06:25:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:01,827 INFO L471 AbstractCegarLoop]: Abstraction has 291031 states and 383786 transitions. [2025-03-08 06:25:01,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 12.807692307692308) internal successors, (333), 26 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 291031 states and 383786 transitions. [2025-03-08 06:25:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 06:25:01,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:01,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:01,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 06:25:02,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:25:02,043 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:02,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash -895987249, now seen corresponding path program 1 times [2025-03-08 06:25:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:02,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277888176] [2025-03-08 06:25:02,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:02,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:02,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 06:25:02,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 06:25:02,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:02,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:02,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:02,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277888176] [2025-03-08 06:25:02,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277888176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:25:02,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085186350] [2025-03-08 06:25:02,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:02,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:25:02,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:25:02,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:25:02,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:25:02,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 06:25:02,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 06:25:02,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:02,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:02,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 06:25:02,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:25:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:03,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:25:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085186350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:25:04,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:25:04,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 32 [2025-03-08 06:25:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562449761] [2025-03-08 06:25:04,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:25:04,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 06:25:04,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:04,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 06:25:04,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2025-03-08 06:25:04,032 INFO L87 Difference]: Start difference. First operand 291031 states and 383786 transitions. Second operand has 32 states, 32 states have (on average 10.96875) internal successors, (351), 32 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:15,713 INFO L93 Difference]: Finished difference Result 1256839 states and 1645162 transitions. [2025-03-08 06:25:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2025-03-08 06:25:15,714 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 10.96875) internal successors, (351), 32 states have internal predecessors, (351), 0 states have call successors, (0), 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 127 [2025-03-08 06:25:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:17,728 INFO L225 Difference]: With dead ends: 1256839 [2025-03-08 06:25:17,729 INFO L226 Difference]: Without dead ends: 965973 [2025-03-08 06:25:17,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13980 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5762, Invalid=32068, Unknown=0, NotChecked=0, Total=37830 [2025-03-08 06:25:17,894 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 4938 mSDsluCounter, 3137 mSDsCounter, 0 mSdLazyCounter, 4574 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4938 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 4665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 4574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:17,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4938 Valid, 3355 Invalid, 4665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 4574 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 06:25:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965973 states.