./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_opt-floodmax.4.ufo.BOUNDED-8.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 36155c026d6f06befb990fb5a3d65a68afe6fa3a7c90cfb309e05b30e27a8889 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:49:03,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:49:03,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 08:49:03,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:49:03,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:49:03,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:49:03,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:49:03,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:49:03,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:49:03,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:49:03,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:49:03,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:49:03,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:49:03,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:49:03,471 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:49:03,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:49:03,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:49:03,475 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:49:03,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:49:03,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:49:03,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:49:03,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:49:03,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:49:03,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:49:03,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:49:03,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:49:03,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:49:03,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:49:03,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:49:03,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:49:03,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:49:03,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:49:03,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:49:03,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:49:03,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:49:03,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:49:03,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:49:03,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:49:03,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:49:03,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:49:03,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:49:03,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:49:03,482 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 36155c026d6f06befb990fb5a3d65a68afe6fa3a7c90cfb309e05b30e27a8889 [2024-11-16 08:49:03,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:49:03,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:49:03,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:49:03,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:49:03,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:49:03,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-16 08:49:04,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:49:05,126 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:49:05,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-16 08:49:05,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bea11b39/bc84cd9f762e40468e3fb30b97a3c559/FLAGcddfd476c [2024-11-16 08:49:05,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bea11b39/bc84cd9f762e40468e3fb30b97a3c559 [2024-11-16 08:49:05,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:49:05,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:49:05,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:49:05,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:49:05,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:49:05,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:49:05" (1/1) ... [2024-11-16 08:49:05,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280595ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:05, skipping insertion in model container [2024-11-16 08:49:05,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:49:05" (1/1) ... [2024-11-16 08:49:05,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:49:06,031 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34950,34963] [2024-11-16 08:49:06,046 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[35840,35853] [2024-11-16 08:49:06,065 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37627,37640] [2024-11-16 08:49:06,076 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[38517,38530] [2024-11-16 08:49:06,099 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[41204,41217] [2024-11-16 08:49:06,110 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[42097,42110] [2024-11-16 08:49:06,127 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[43887,43900] [2024-11-16 08:49:06,141 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[45248,45261] [2024-11-16 08:49:06,258 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[60716,60729] [2024-11-16 08:49:06,269 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[61609,61622] [2024-11-16 08:49:06,286 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[63399,63412] [2024-11-16 08:49:06,322 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[67812,67825] [2024-11-16 08:49:06,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:49:06,436 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:49:06,593 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34950,34963] [2024-11-16 08:49:06,602 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[35840,35853] [2024-11-16 08:49:06,615 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37627,37640] [2024-11-16 08:49:06,624 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[38517,38530] [2024-11-16 08:49:06,643 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[41204,41217] [2024-11-16 08:49:06,652 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[42097,42110] [2024-11-16 08:49:06,665 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[43887,43900] [2024-11-16 08:49:06,677 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[45248,45261] [2024-11-16 08:49:06,754 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[60716,60729] [2024-11-16 08:49:06,763 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[61609,61622] [2024-11-16 08:49:06,780 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[63399,63412] [2024-11-16 08:49:06,813 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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[67812,67825] [2024-11-16 08:49:06,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:49:06,902 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:49:06,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06 WrapperNode [2024-11-16 08:49:06,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:49:06,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:49:06,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:49:06,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:49:06,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:06,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:07,036 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4310 [2024-11-16 08:49:07,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:49:07,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:49:07,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:49:07,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:49:07,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:07,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:07,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:07,103 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]. [2024-11-16 08:49:07,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:07,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:07,136 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:07,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:07,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:07,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:07,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:49:07,188 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:49:07,188 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:49:07,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:49:07,189 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (1/1) ... [2024-11-16 08:49:07,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:49:07,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:49:07,217 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) [2024-11-16 08:49:07,220 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 [2024-11-16 08:49:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:49:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:49:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:49:07,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:49:07,507 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:49:07,508 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:49:09,513 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3934: havoc main_~node2__newmax~7#1; [2024-11-16 08:49:09,513 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4331: havoc main_~check__tmp~17#1; [2024-11-16 08:49:09,513 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2485: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2024-11-16 08:49:09,514 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4210: havoc main_~node4__newmax~11#1; [2024-11-16 08:49:09,514 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2370: havoc main_~node3__newmax~6#1; [2024-11-16 08:49:09,514 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4089: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2024-11-16 08:49:09,514 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L5015: havoc main_~check__tmp~21#1; [2024-11-16 08:49:09,514 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166: havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2024-11-16 08:49:09,514 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2904: havoc main_~node4__newmax~9#1; [2024-11-16 08:49:09,514 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4888: havoc main_~check__tmp~20#1; [2024-11-16 08:49:09,514 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778: havoc main_~node1__newmax~6#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2024-11-16 08:49:09,514 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1856: havoc main_~node2__newmax~5#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4633: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~18#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3974: havoc main_~node3__newmax~8#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2264: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2132: havoc main_~node4__newmax~6#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3326: havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4518: havoc main_~node3__newmax~9#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2011: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2410: havoc main_~node4__newmax~7#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2681: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2820: havoc main_~node2__newmax~6#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: havoc main_~node3__newmax~5#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4146: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4014: havoc main_~node4__newmax~10#1; [2024-11-16 08:49:09,515 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3486: havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4679: havoc main_~check__tmp~19#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4285: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: havoc main_~check__tmp~13#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4558: havoc main_~node4__newmax~12#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4824: havoc main_~node4__newmax~13#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3646: havoc main_~node1____CPAchecker_TMP_2~3#1;havoc main_~node1____CPAchecker_TMP_1~3#1;havoc main_~node1____CPAchecker_TMP_0~3#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2068: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1936: havoc main_~node4__newmax~5#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2862: havoc main_~node3__newmax~7#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2207: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: havoc main_~node4__newmax~8#1; [2024-11-16 08:49:09,516 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816: havoc main_~node1__newmax~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__newmax~4#1;havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__newmax~4#1;havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__newmax~4#1;havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1;havoc main_~node1__newmax~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node4__newmax~3#1;havoc main_~node3__newmax~3#1;havoc main_~node2__newmax~3#1;havoc main_~node1__newmax~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__newmax~2#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__newmax~2#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__newmax~2#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__newmax~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__newmax~1#1;havoc main_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__newmax~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2024-11-16 08:49:09,753 INFO L? ?]: Removed 296 outVars from TransFormulas that were not future-live. [2024-11-16 08:49:09,753 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:49:09,778 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:49:09,779 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:49:09,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:49:09 BoogieIcfgContainer [2024-11-16 08:49:09,779 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:49:09,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:49:09,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:49:09,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:49:09,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:49:05" (1/3) ... [2024-11-16 08:49:09,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98c5cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:49:09, skipping insertion in model container [2024-11-16 08:49:09,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:06" (2/3) ... [2024-11-16 08:49:09,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98c5cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:49:09, skipping insertion in model container [2024-11-16 08:49:09,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:49:09" (3/3) ... [2024-11-16 08:49:09,785 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-16 08:49:09,802 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:49:09,802 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-16 08:49:09,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:49:09,875 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;@1a6779f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:49:09,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-16 08:49:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 1152 states, 1139 states have (on average 1.6962247585601404) internal successors, (1932), 1151 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-11-16 08:49:09,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:09,921 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:09,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:09,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:09,927 INFO L85 PathProgramCache]: Analyzing trace with hash 436848934, now seen corresponding path program 1 times [2024-11-16 08:49:09,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:09,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897611252] [2024-11-16 08:49:09,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:09,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:10,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897611252] [2024-11-16 08:49:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897611252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:10,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:10,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:49:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485693735] [2024-11-16 08:49:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:10,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:49:10,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:10,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:49:10,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:49:10,718 INFO L87 Difference]: Start difference. First operand has 1152 states, 1139 states have (on average 1.6962247585601404) internal successors, (1932), 1151 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:10,971 INFO L93 Difference]: Finished difference Result 1993 states and 3327 transitions. [2024-11-16 08:49:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:49:10,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 362 [2024-11-16 08:49:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:10,998 INFO L225 Difference]: With dead ends: 1993 [2024-11-16 08:49:10,998 INFO L226 Difference]: Without dead ends: 1657 [2024-11-16 08:49:11,002 INFO L431 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 [2024-11-16 08:49:11,007 INFO L432 NwaCegarLoop]: 2116 mSDtfsCounter, 1014 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:11,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 3524 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:49:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-11-16 08:49:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1655. [2024-11-16 08:49:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1643 states have (on average 1.481436396835058) internal successors, (2434), 1654 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2434 transitions. [2024-11-16 08:49:11,099 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2434 transitions. Word has length 362 [2024-11-16 08:49:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:11,100 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2434 transitions. [2024-11-16 08:49:11,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2434 transitions. [2024-11-16 08:49:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-11-16 08:49:11,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:11,113 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:11,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:49:11,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:11,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:11,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1146386730, now seen corresponding path program 1 times [2024-11-16 08:49:11,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:11,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097993702] [2024-11-16 08:49:11,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:11,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:11,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:11,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097993702] [2024-11-16 08:49:11,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097993702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:11,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:11,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:49:11,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830773107] [2024-11-16 08:49:11,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:11,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:49:11,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:11,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:49:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:49:11,464 INFO L87 Difference]: Start difference. First operand 1655 states and 2434 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:11,629 INFO L93 Difference]: Finished difference Result 3182 states and 4729 transitions. [2024-11-16 08:49:11,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:49:11,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 362 [2024-11-16 08:49:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:11,641 INFO L225 Difference]: With dead ends: 3182 [2024-11-16 08:49:11,641 INFO L226 Difference]: Without dead ends: 2719 [2024-11-16 08:49:11,643 INFO L431 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 [2024-11-16 08:49:11,644 INFO L432 NwaCegarLoop]: 1851 mSDtfsCounter, 867 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:11,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 3100 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:49:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2024-11-16 08:49:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2717. [2024-11-16 08:49:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2705 states have (on average 1.4865064695009242) internal successors, (4021), 2716 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4021 transitions. [2024-11-16 08:49:11,680 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4021 transitions. Word has length 362 [2024-11-16 08:49:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:11,681 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 4021 transitions. [2024-11-16 08:49:11,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4021 transitions. [2024-11-16 08:49:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-11-16 08:49:11,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:11,687 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:11,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 08:49:11,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:11,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash 243240413, now seen corresponding path program 1 times [2024-11-16 08:49:11,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:11,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832215226] [2024-11-16 08:49:11,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:11,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:12,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:12,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832215226] [2024-11-16 08:49:12,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832215226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:12,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:12,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:49:12,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429479435] [2024-11-16 08:49:12,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:12,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:49:12,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:49:12,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:49:12,618 INFO L87 Difference]: Start difference. First operand 2717 states and 4021 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:12,796 INFO L93 Difference]: Finished difference Result 10601 states and 15641 transitions. [2024-11-16 08:49:12,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:49:12,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 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 362 [2024-11-16 08:49:12,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:12,820 INFO L225 Difference]: With dead ends: 10601 [2024-11-16 08:49:12,820 INFO L226 Difference]: Without dead ends: 7945 [2024-11-16 08:49:12,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:49:12,829 INFO L432 NwaCegarLoop]: 2648 mSDtfsCounter, 3647 mSDsluCounter, 3132 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3647 SdHoareTripleChecker+Valid, 5780 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:12,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3647 Valid, 5780 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:49:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7945 states. [2024-11-16 08:49:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7945 to 5208. [2024-11-16 08:49:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5208 states, 5196 states have (on average 1.4795996920708236) internal successors, (7688), 5207 states have internal predecessors, (7688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 7688 transitions. [2024-11-16 08:49:12,957 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 7688 transitions. Word has length 362 [2024-11-16 08:49:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:12,957 INFO L471 AbstractCegarLoop]: Abstraction has 5208 states and 7688 transitions. [2024-11-16 08:49:12,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 7688 transitions. [2024-11-16 08:49:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2024-11-16 08:49:12,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:12,969 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:12,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 08:49:12,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:12,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:12,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1521868953, now seen corresponding path program 1 times [2024-11-16 08:49:12,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:12,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970417930] [2024-11-16 08:49:12,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:13,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970417930] [2024-11-16 08:49:13,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970417930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:13,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:13,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:49:13,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706355737] [2024-11-16 08:49:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:13,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:49:13,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:13,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:49:13,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:49:13,180 INFO L87 Difference]: Start difference. First operand 5208 states and 7688 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 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) [2024-11-16 08:49:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:13,293 INFO L93 Difference]: Finished difference Result 15279 states and 22496 transitions. [2024-11-16 08:49:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:49:13,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 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) Word has length 364 [2024-11-16 08:49:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:13,318 INFO L225 Difference]: With dead ends: 15279 [2024-11-16 08:49:13,319 INFO L226 Difference]: Without dead ends: 10236 [2024-11-16 08:49:13,326 INFO L431 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 [2024-11-16 08:49:13,328 INFO L432 NwaCegarLoop]: 3232 mSDtfsCounter, 1507 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 4822 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:13,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 4822 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:49:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10236 states. [2024-11-16 08:49:13,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10236 to 10106. [2024-11-16 08:49:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10106 states, 10094 states have (on average 1.470972855161482) internal successors, (14848), 10105 states have internal predecessors, (14848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10106 states to 10106 states and 14848 transitions. [2024-11-16 08:49:13,533 INFO L78 Accepts]: Start accepts. Automaton has 10106 states and 14848 transitions. Word has length 364 [2024-11-16 08:49:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:13,533 INFO L471 AbstractCegarLoop]: Abstraction has 10106 states and 14848 transitions. [2024-11-16 08:49:13,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 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) [2024-11-16 08:49:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 10106 states and 14848 transitions. [2024-11-16 08:49:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-16 08:49:13,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:13,547 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:13,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 08:49:13,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:13,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1316131896, now seen corresponding path program 1 times [2024-11-16 08:49:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918770583] [2024-11-16 08:49:13,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:13,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:13,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918770583] [2024-11-16 08:49:13,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918770583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:13,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:13,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:49:13,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225462497] [2024-11-16 08:49:13,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:13,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:49:13,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:13,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:49:13,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:49:13,675 INFO L87 Difference]: Start difference. First operand 10106 states and 14848 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:13,819 INFO L93 Difference]: Finished difference Result 30227 states and 44399 transitions. [2024-11-16 08:49:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:49:13,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 365 [2024-11-16 08:49:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:13,866 INFO L225 Difference]: With dead ends: 30227 [2024-11-16 08:49:13,866 INFO L226 Difference]: Without dead ends: 20171 [2024-11-16 08:49:13,883 INFO L431 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 [2024-11-16 08:49:13,884 INFO L432 NwaCegarLoop]: 3289 mSDtfsCounter, 1642 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 4932 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:13,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 4932 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:49:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20171 states. [2024-11-16 08:49:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20171 to 10131. [2024-11-16 08:49:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10131 states, 10119 states have (on average 1.4707975096353394) internal successors, (14883), 10130 states have internal predecessors, (14883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10131 states to 10131 states and 14883 transitions. [2024-11-16 08:49:14,136 INFO L78 Accepts]: Start accepts. Automaton has 10131 states and 14883 transitions. Word has length 365 [2024-11-16 08:49:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:14,136 INFO L471 AbstractCegarLoop]: Abstraction has 10131 states and 14883 transitions. [2024-11-16 08:49:14,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 10131 states and 14883 transitions. [2024-11-16 08:49:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-11-16 08:49:14,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:14,148 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:14,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 08:49:14,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:14,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2077223601, now seen corresponding path program 1 times [2024-11-16 08:49:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:14,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138822992] [2024-11-16 08:49:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:14,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138822992] [2024-11-16 08:49:14,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138822992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:14,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:14,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:49:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017943115] [2024-11-16 08:49:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:14,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:49:14,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:14,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:49:14,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:49:14,266 INFO L87 Difference]: Start difference. First operand 10131 states and 14883 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:14,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:14,419 INFO L93 Difference]: Finished difference Result 20206 states and 29678 transitions. [2024-11-16 08:49:14,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:49:14,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 366 [2024-11-16 08:49:14,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:14,437 INFO L225 Difference]: With dead ends: 20206 [2024-11-16 08:49:14,438 INFO L226 Difference]: Without dead ends: 10151 [2024-11-16 08:49:14,443 INFO L431 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 [2024-11-16 08:49:14,444 INFO L432 NwaCegarLoop]: 1669 mSDtfsCounter, 6 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3322 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:14,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3322 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:49:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10151 states. [2024-11-16 08:49:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10151 to 10151. [2024-11-16 08:49:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10151 states, 10139 states have (on average 1.4701647105237203) internal successors, (14906), 10150 states have internal predecessors, (14906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10151 states to 10151 states and 14906 transitions. [2024-11-16 08:49:14,558 INFO L78 Accepts]: Start accepts. Automaton has 10151 states and 14906 transitions. Word has length 366 [2024-11-16 08:49:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:14,558 INFO L471 AbstractCegarLoop]: Abstraction has 10151 states and 14906 transitions. [2024-11-16 08:49:14,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 10151 states and 14906 transitions. [2024-11-16 08:49:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-16 08:49:14,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:14,570 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:14,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 08:49:14,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:14,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:14,571 INFO L85 PathProgramCache]: Analyzing trace with hash -804607191, now seen corresponding path program 1 times [2024-11-16 08:49:14,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:14,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230554542] [2024-11-16 08:49:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:14,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:14,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:14,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230554542] [2024-11-16 08:49:14,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230554542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:14,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:14,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:49:14,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164072112] [2024-11-16 08:49:14,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:14,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:49:14,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:14,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:49:14,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:49:14,697 INFO L87 Difference]: Start difference. First operand 10151 states and 14906 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:14,847 INFO L93 Difference]: Finished difference Result 24777 states and 36596 transitions. [2024-11-16 08:49:14,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:49:14,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-11-16 08:49:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:14,870 INFO L225 Difference]: With dead ends: 24777 [2024-11-16 08:49:14,871 INFO L226 Difference]: Without dead ends: 15641 [2024-11-16 08:49:14,883 INFO L431 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 [2024-11-16 08:49:14,884 INFO L432 NwaCegarLoop]: 2182 mSDtfsCounter, 741 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:14,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 3590 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:49:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15641 states. [2024-11-16 08:49:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15641 to 12599. [2024-11-16 08:49:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12599 states, 12587 states have (on average 1.4827997139906253) internal successors, (18664), 12598 states have internal predecessors, (18664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12599 states to 12599 states and 18664 transitions. [2024-11-16 08:49:15,106 INFO L78 Accepts]: Start accepts. Automaton has 12599 states and 18664 transitions. Word has length 368 [2024-11-16 08:49:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:15,106 INFO L471 AbstractCegarLoop]: Abstraction has 12599 states and 18664 transitions. [2024-11-16 08:49:15,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 12599 states and 18664 transitions. [2024-11-16 08:49:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-16 08:49:15,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:15,122 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:15,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 08:49:15,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:15,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:15,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1762196049, now seen corresponding path program 1 times [2024-11-16 08:49:15,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:15,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419430801] [2024-11-16 08:49:15,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:15,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:15,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419430801] [2024-11-16 08:49:15,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419430801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:15,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:15,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:49:15,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59271852] [2024-11-16 08:49:15,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:15,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:49:15,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:15,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:49:15,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:49:15,334 INFO L87 Difference]: Start difference. First operand 12599 states and 18664 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:15,475 INFO L93 Difference]: Finished difference Result 35590 states and 52592 transitions. [2024-11-16 08:49:15,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:49:15,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-11-16 08:49:15,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:15,510 INFO L225 Difference]: With dead ends: 35590 [2024-11-16 08:49:15,510 INFO L226 Difference]: Without dead ends: 23306 [2024-11-16 08:49:15,529 INFO L431 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 [2024-11-16 08:49:15,531 INFO L432 NwaCegarLoop]: 3229 mSDtfsCounter, 1497 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 4816 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:15,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 4816 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:49:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23306 states. [2024-11-16 08:49:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23306 to 23176. [2024-11-16 08:49:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23176 states, 23164 states have (on average 1.471939216024866) internal successors, (34096), 23175 states have internal predecessors, (34096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23176 states to 23176 states and 34096 transitions. [2024-11-16 08:49:15,821 INFO L78 Accepts]: Start accepts. Automaton has 23176 states and 34096 transitions. Word has length 368 [2024-11-16 08:49:15,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:15,821 INFO L471 AbstractCegarLoop]: Abstraction has 23176 states and 34096 transitions. [2024-11-16 08:49:15,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:15,822 INFO L276 IsEmpty]: Start isEmpty. Operand 23176 states and 34096 transitions. [2024-11-16 08:49:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-16 08:49:15,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:15,842 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:15,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 08:49:15,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:15,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash -866910125, now seen corresponding path program 1 times [2024-11-16 08:49:15,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:15,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131511761] [2024-11-16 08:49:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:16,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:16,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131511761] [2024-11-16 08:49:16,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131511761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:16,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:16,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:49:16,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209039439] [2024-11-16 08:49:16,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:16,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:49:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:16,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:49:16,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:49:16,550 INFO L87 Difference]: Start difference. First operand 23176 states and 34096 transitions. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:16,704 INFO L93 Difference]: Finished difference Result 68284 states and 100342 transitions. [2024-11-16 08:49:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:49:16,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-11-16 08:49:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:16,773 INFO L225 Difference]: With dead ends: 68284 [2024-11-16 08:49:16,773 INFO L226 Difference]: Without dead ends: 45824 [2024-11-16 08:49:16,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:49:16,803 INFO L432 NwaCegarLoop]: 3284 mSDtfsCounter, 1606 mSDsluCounter, 4926 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 8210 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:16,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 8210 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:49:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45824 states. [2024-11-16 08:49:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45824 to 23492. [2024-11-16 08:49:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23492 states, 23480 states have (on average 1.472146507666099) internal successors, (34566), 23491 states have internal predecessors, (34566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23492 states to 23492 states and 34566 transitions. [2024-11-16 08:49:17,236 INFO L78 Accepts]: Start accepts. Automaton has 23492 states and 34566 transitions. Word has length 368 [2024-11-16 08:49:17,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:17,236 INFO L471 AbstractCegarLoop]: Abstraction has 23492 states and 34566 transitions. [2024-11-16 08:49:17,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 23492 states and 34566 transitions. [2024-11-16 08:49:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-16 08:49:17,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:17,255 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:17,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 08:49:17,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:17,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2015851606, now seen corresponding path program 1 times [2024-11-16 08:49:17,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:17,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474477238] [2024-11-16 08:49:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:17,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:17,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:17,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474477238] [2024-11-16 08:49:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474477238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:17,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:17,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:49:17,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898558662] [2024-11-16 08:49:17,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:17,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:49:17,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:17,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:49:17,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:49:17,383 INFO L87 Difference]: Start difference. First operand 23492 states and 34566 transitions. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:17,651 INFO L93 Difference]: Finished difference Result 57541 states and 85118 transitions. [2024-11-16 08:49:17,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:49:17,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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 370 [2024-11-16 08:49:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:17,710 INFO L225 Difference]: With dead ends: 57541 [2024-11-16 08:49:17,710 INFO L226 Difference]: Without dead ends: 36589 [2024-11-16 08:49:17,732 INFO L431 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 [2024-11-16 08:49:17,733 INFO L432 NwaCegarLoop]: 2178 mSDtfsCounter, 750 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 3551 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:17,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 3551 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:49:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36589 states. [2024-11-16 08:49:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36589 to 31648. [2024-11-16 08:49:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31648 states, 31636 states have (on average 1.4839423441648754) internal successors, (46946), 31647 states have internal predecessors, (46946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31648 states to 31648 states and 46946 transitions. [2024-11-16 08:49:18,194 INFO L78 Accepts]: Start accepts. Automaton has 31648 states and 46946 transitions. Word has length 370 [2024-11-16 08:49:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:18,194 INFO L471 AbstractCegarLoop]: Abstraction has 31648 states and 46946 transitions. [2024-11-16 08:49:18,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 31648 states and 46946 transitions. [2024-11-16 08:49:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-16 08:49:18,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:18,212 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:18,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 08:49:18,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:18,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash -839126657, now seen corresponding path program 1 times [2024-11-16 08:49:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:18,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571893348] [2024-11-16 08:49:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:18,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:18,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571893348] [2024-11-16 08:49:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571893348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:18,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:18,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:49:18,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110489202] [2024-11-16 08:49:18,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:18,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:49:18,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:18,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:49:18,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:49:18,484 INFO L87 Difference]: Start difference. First operand 31648 states and 46946 transitions. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:18,901 INFO L93 Difference]: Finished difference Result 76655 states and 114881 transitions. [2024-11-16 08:49:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:49:18,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 371 [2024-11-16 08:49:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:18,989 INFO L225 Difference]: With dead ends: 76655 [2024-11-16 08:49:18,989 INFO L226 Difference]: Without dead ends: 59275 [2024-11-16 08:49:19,021 INFO L431 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 [2024-11-16 08:49:19,022 INFO L432 NwaCegarLoop]: 1817 mSDtfsCounter, 903 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:19,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 3094 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:49:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59275 states. [2024-11-16 08:49:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59275 to 59216. [2024-11-16 08:49:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59216 states, 59204 states have (on average 1.4862002567394095) internal successors, (87989), 59215 states have internal predecessors, (87989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59216 states to 59216 states and 87989 transitions. [2024-11-16 08:49:19,858 INFO L78 Accepts]: Start accepts. Automaton has 59216 states and 87989 transitions. Word has length 371 [2024-11-16 08:49:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:19,859 INFO L471 AbstractCegarLoop]: Abstraction has 59216 states and 87989 transitions. [2024-11-16 08:49:19,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 59216 states and 87989 transitions. [2024-11-16 08:49:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-16 08:49:19,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:19,881 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:19,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 08:49:19,881 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:19,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:19,882 INFO L85 PathProgramCache]: Analyzing trace with hash -839557633, now seen corresponding path program 1 times [2024-11-16 08:49:19,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:19,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645682618] [2024-11-16 08:49:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:20,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:20,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645682618] [2024-11-16 08:49:20,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645682618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:20,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:20,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 08:49:20,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267657603] [2024-11-16 08:49:20,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:20,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 08:49:20,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:20,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 08:49:20,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:49:20,486 INFO L87 Difference]: Start difference. First operand 59216 states and 87989 transitions. Second operand has 9 states, 9 states have (on average 41.22222222222222) internal successors, (371), 9 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:25,372 INFO L93 Difference]: Finished difference Result 525808 states and 792569 transitions. [2024-11-16 08:49:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-16 08:49:25,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 41.22222222222222) internal successors, (371), 9 states have internal predecessors, (371), 0 states have call successors, (0), 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 371 [2024-11-16 08:49:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:26,208 INFO L225 Difference]: With dead ends: 525808 [2024-11-16 08:49:26,208 INFO L226 Difference]: Without dead ends: 503145 [2024-11-16 08:49:26,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=1112, Unknown=0, NotChecked=0, Total=1482 [2024-11-16 08:49:26,321 INFO L432 NwaCegarLoop]: 1943 mSDtfsCounter, 38300 mSDsluCounter, 11853 mSDsCounter, 0 mSdLazyCounter, 4278 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38300 SdHoareTripleChecker+Valid, 13796 SdHoareTripleChecker+Invalid, 4989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 4278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:26,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38300 Valid, 13796 Invalid, 4989 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [711 Valid, 4278 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 08:49:26,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503145 states. [2024-11-16 08:49:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503145 to 178653. [2024-11-16 08:49:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178653 states, 178641 states have (on average 1.4884544981275296) internal successors, (265899), 178652 states have internal predecessors, (265899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178653 states to 178653 states and 265899 transitions. [2024-11-16 08:49:30,751 INFO L78 Accepts]: Start accepts. Automaton has 178653 states and 265899 transitions. Word has length 371 [2024-11-16 08:49:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:30,751 INFO L471 AbstractCegarLoop]: Abstraction has 178653 states and 265899 transitions. [2024-11-16 08:49:30,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 41.22222222222222) internal successors, (371), 9 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 178653 states and 265899 transitions. [2024-11-16 08:49:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-16 08:49:30,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:30,800 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:30,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 08:49:30,800 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:30,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash 546645761, now seen corresponding path program 1 times [2024-11-16 08:49:30,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:30,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476273182] [2024-11-16 08:49:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:30,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:31,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476273182] [2024-11-16 08:49:31,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476273182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:31,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:31,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 08:49:31,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959180966] [2024-11-16 08:49:31,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:31,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 08:49:31,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:31,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 08:49:31,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:49:31,696 INFO L87 Difference]: Start difference. First operand 178653 states and 265899 transitions. Second operand has 9 states, 9 states have (on average 41.22222222222222) internal successors, (371), 8 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:34,722 INFO L93 Difference]: Finished difference Result 451189 states and 678954 transitions. [2024-11-16 08:49:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 08:49:34,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 41.22222222222222) internal successors, (371), 8 states have internal predecessors, (371), 0 states have call successors, (0), 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 371 [2024-11-16 08:49:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:35,254 INFO L225 Difference]: With dead ends: 451189 [2024-11-16 08:49:35,255 INFO L226 Difference]: Without dead ends: 346857 [2024-11-16 08:49:35,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-11-16 08:49:35,356 INFO L432 NwaCegarLoop]: 1323 mSDtfsCounter, 17721 mSDsluCounter, 6771 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17721 SdHoareTripleChecker+Valid, 8094 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:35,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17721 Valid, 8094 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 08:49:35,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346857 states. [2024-11-16 08:49:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346857 to 127815. [2024-11-16 08:49:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127815 states, 127803 states have (on average 1.4768902138447455) internal successors, (188751), 127814 states have internal predecessors, (188751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127815 states to 127815 states and 188751 transitions. [2024-11-16 08:49:38,480 INFO L78 Accepts]: Start accepts. Automaton has 127815 states and 188751 transitions. Word has length 371 [2024-11-16 08:49:38,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:38,480 INFO L471 AbstractCegarLoop]: Abstraction has 127815 states and 188751 transitions. [2024-11-16 08:49:38,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 41.22222222222222) internal successors, (371), 8 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 127815 states and 188751 transitions. [2024-11-16 08:49:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-16 08:49:38,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:38,524 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:38,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 08:49:38,524 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:38,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:38,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1503763137, now seen corresponding path program 1 times [2024-11-16 08:49:38,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:38,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81461524] [2024-11-16 08:49:38,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:38,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:39,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:39,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81461524] [2024-11-16 08:49:39,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81461524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:39,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:39,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:49:39,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34253864] [2024-11-16 08:49:39,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:39,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:49:39,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:39,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:49:39,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:49:39,455 INFO L87 Difference]: Start difference. First operand 127815 states and 188751 transitions. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:40,755 INFO L93 Difference]: Finished difference Result 499726 states and 737324 transitions. [2024-11-16 08:49:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:49:40,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 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 371 [2024-11-16 08:49:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:41,635 INFO L225 Difference]: With dead ends: 499726 [2024-11-16 08:49:41,635 INFO L226 Difference]: Without dead ends: 372167 [2024-11-16 08:49:41,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:49:41,769 INFO L432 NwaCegarLoop]: 2828 mSDtfsCounter, 3393 mSDsluCounter, 3081 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3393 SdHoareTripleChecker+Valid, 5909 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:41,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3393 Valid, 5909 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:49:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372167 states. [2024-11-16 08:49:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372167 to 249820. [2024-11-16 08:49:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249820 states, 249808 states have (on average 1.4696727086402357) internal successors, (367136), 249819 states have internal predecessors, (367136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249820 states to 249820 states and 367136 transitions. [2024-11-16 08:49:46,249 INFO L78 Accepts]: Start accepts. Automaton has 249820 states and 367136 transitions. Word has length 371 [2024-11-16 08:49:46,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:46,250 INFO L471 AbstractCegarLoop]: Abstraction has 249820 states and 367136 transitions. [2024-11-16 08:49:46,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 249820 states and 367136 transitions. [2024-11-16 08:49:46,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-16 08:49:46,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:49:46,364 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:49:46,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 08:49:46,365 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-16 08:49:46,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:49:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash -146354941, now seen corresponding path program 1 times [2024-11-16 08:49:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:49:46,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332332102] [2024-11-16 08:49:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:49:46,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:49:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:49:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:49:46,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:49:46,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332332102] [2024-11-16 08:49:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332332102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:49:46,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:49:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:49:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774717029] [2024-11-16 08:49:46,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:49:46,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:49:46,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:49:46,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:49:46,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:49:46,647 INFO L87 Difference]: Start difference. First operand 249820 states and 367136 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:49:48,420 INFO L93 Difference]: Finished difference Result 738805 states and 1085352 transitions. [2024-11-16 08:49:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:49:48,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 373 [2024-11-16 08:49:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:49:49,064 INFO L225 Difference]: With dead ends: 738805 [2024-11-16 08:49:49,064 INFO L226 Difference]: Without dead ends: 490787 [2024-11-16 08:49:49,776 INFO L431 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 [2024-11-16 08:49:49,776 INFO L432 NwaCegarLoop]: 2833 mSDtfsCounter, 1476 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 4401 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:49:49,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 4401 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:49:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490787 states. [2024-11-16 08:49:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490787 to 490600. [2024-11-16 08:49:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490600 states, 490588 states have (on average 1.4638311577127854) internal successors, (718138), 490599 states have internal predecessors, (718138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490600 states to 490600 states and 718138 transitions. [2024-11-16 08:49:56,690 INFO L78 Accepts]: Start accepts. Automaton has 490600 states and 718138 transitions. Word has length 373 [2024-11-16 08:49:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:49:56,691 INFO L471 AbstractCegarLoop]: Abstraction has 490600 states and 718138 transitions. [2024-11-16 08:49:56,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:49:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 490600 states and 718138 transitions.