./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.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 7de925c132a7c7e17dbaa287f5760b6cfcdaa30e9bf1eb8266d373ba54e5d2bb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 23:01:18,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 23:01:18,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 23:01:18,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 23:01:18,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 23:01:18,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 23:01:18,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 23:01:18,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 23:01:18,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 23:01:18,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 23:01:18,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 23:01:18,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 23:01:18,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 23:01:18,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 23:01:18,515 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 23:01:18,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 23:01:18,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 23:01:18,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 23:01:18,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 23:01:18,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 23:01:18,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 23:01:18,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 23:01:18,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 23:01:18,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 23:01:18,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 23:01:18,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 23:01:18,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 23:01:18,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 23:01:18,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 23:01:18,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 23:01:18,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 23:01:18,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 23:01:18,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:01:18,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 23:01:18,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 23:01:18,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 23:01:18,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 23:01:18,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 23:01:18,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 23:01:18,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 23:01:18,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 23:01:18,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 23:01:18,523 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 -> 7de925c132a7c7e17dbaa287f5760b6cfcdaa30e9bf1eb8266d373ba54e5d2bb [2024-11-19 23:01:18,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 23:01:18,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 23:01:18,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 23:01:18,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 23:01:18,781 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 23:01:18,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-19 23:01:20,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 23:01:20,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 23:01:20,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-19 23:01:20,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9bbee55/61b568dc59324cac9ce65bac660e47aa/FLAGb3ac086bb [2024-11-19 23:01:20,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9bbee55/61b568dc59324cac9ce65bac660e47aa [2024-11-19 23:01:20,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 23:01:20,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 23:01:20,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 23:01:20,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 23:01:20,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 23:01:20,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:01:20" (1/1) ... [2024-11-19 23:01:20,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674f8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:20, skipping insertion in model container [2024-11-19 23:01:20,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:01:20" (1/1) ... [2024-11-19 23:01:20,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 23:01:21,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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34952,34965] [2024-11-19 23:01:21,092 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[35842,35855] [2024-11-19 23:01:21,111 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37629,37642] [2024-11-19 23:01:21,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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[38987,39000] [2024-11-19 23:01:21,226 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[53558,53571] [2024-11-19 23:01:21,304 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[62798,62811] [2024-11-19 23:01:21,316 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[63691,63704] [2024-11-19 23:01:21,334 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[65481,65494] [2024-11-19 23:01:21,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[66374,66387] [2024-11-19 23:01:21,368 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[69061,69074] [2024-11-19 23:01:21,379 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[69954,69967] [2024-11-19 23:01:21,396 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[71744,71757] [2024-11-19 23:01:21,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:01:21,475 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 23:01:21,632 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34952,34965] [2024-11-19 23:01:21,641 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[35842,35855] [2024-11-19 23:01:21,656 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37629,37642] [2024-11-19 23:01:21,681 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[38987,39000] [2024-11-19 23:01:21,753 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[53558,53571] [2024-11-19 23:01:21,814 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[62798,62811] [2024-11-19 23:01:21,824 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[63691,63704] [2024-11-19 23:01:21,838 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[65481,65494] [2024-11-19 23:01:21,847 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[66374,66387] [2024-11-19 23:01:21,865 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[69061,69074] [2024-11-19 23:01:21,874 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[69954,69967] [2024-11-19 23:01:21,888 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[71744,71757] [2024-11-19 23:01:21,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:01:21,946 INFO L204 MainTranslator]: Completed translation [2024-11-19 23:01:21,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21 WrapperNode [2024-11-19 23:01:21,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 23:01:21,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 23:01:21,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 23:01:21,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 23:01:21,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:21,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:22,072 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4310 [2024-11-19 23:01:22,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 23:01:22,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 23:01:22,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 23:01:22,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 23:01:22,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:22,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:22,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:22,153 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-19 23:01:22,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:22,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:22,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:22,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:22,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:22,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:22,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 23:01:22,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 23:01:22,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 23:01:22,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 23:01:22,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (1/1) ... [2024-11-19 23:01:22,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:01:22,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 23:01:22,294 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-19 23:01:22,298 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-19 23:01:22,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 23:01:22,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 23:01:22,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 23:01:22,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 23:01:22,569 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 23:01:22,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 23:01:24,854 INFO L? ?]: Removed 296 outVars from TransFormulas that were not future-live. [2024-11-19 23:01:24,854 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 23:01:24,880 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 23:01:24,880 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 23:01:24,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:01:24 BoogieIcfgContainer [2024-11-19 23:01:24,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 23:01:24,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 23:01:24,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 23:01:24,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 23:01:24,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:01:20" (1/3) ... [2024-11-19 23:01:24,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21108e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:01:24, skipping insertion in model container [2024-11-19 23:01:24,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:01:21" (2/3) ... [2024-11-19 23:01:24,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21108e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:01:24, skipping insertion in model container [2024-11-19 23:01:24,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:01:24" (3/3) ... [2024-11-19 23:01:24,891 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-19 23:01:24,903 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 23:01:24,904 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-19 23:01:24,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 23:01:24,980 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;@628c226c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 23:01:24,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-19 23:01:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 987 states, 974 states have (on average 1.8141683778234086) internal successors, (1767), 986 states have internal predecessors, (1767), 0 states have call successors, (0), 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-19 23:01:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-19 23:01:25,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:25,009 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] [2024-11-19 23:01:25,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:25,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:25,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1465969387, now seen corresponding path program 1 times [2024-11-19 23:01:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709458255] [2024-11-19 23:01:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:25,912 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-19 23:01:25,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:25,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709458255] [2024-11-19 23:01:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709458255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:25,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:25,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319779687] [2024-11-19 23:01:25,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:25,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:25,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:25,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:25,949 INFO L87 Difference]: Start difference. First operand has 987 states, 974 states have (on average 1.8141683778234086) internal successors, (1767), 986 states have internal predecessors, (1767), 0 states have call successors, (0), 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 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-19 23:01:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:26,296 INFO L93 Difference]: Finished difference Result 1762 states and 3134 transitions. [2024-11-19 23:01:26,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:26,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 314 [2024-11-19 23:01:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:26,324 INFO L225 Difference]: With dead ends: 1762 [2024-11-19 23:01:26,325 INFO L226 Difference]: Without dead ends: 1543 [2024-11-19 23:01:26,329 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-19 23:01:26,334 INFO L432 NwaCegarLoop]: 1894 mSDtfsCounter, 1045 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 3209 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 23:01:26,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 3209 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 23:01:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-11-19 23:01:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1541. [2024-11-19 23:01:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1529 states have (on average 1.5604970568999346) internal successors, (2386), 1540 states have internal predecessors, (2386), 0 states have call successors, (0), 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-19 23:01:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2386 transitions. [2024-11-19 23:01:26,501 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2386 transitions. Word has length 314 [2024-11-19 23:01:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:26,504 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 2386 transitions. [2024-11-19 23:01:26,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-19 23:01:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2386 transitions. [2024-11-19 23:01:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-19 23:01:26,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:26,514 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] [2024-11-19 23:01:26,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 23:01:26,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:26,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1465538411, now seen corresponding path program 1 times [2024-11-19 23:01:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251330471] [2024-11-19 23:01:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:27,740 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-19 23:01:27,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:27,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251330471] [2024-11-19 23:01:27,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251330471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:27,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:27,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 23:01:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531954178] [2024-11-19 23:01:27,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:27,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 23:01:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:27,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 23:01:27,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 23:01:27,746 INFO L87 Difference]: Start difference. First operand 1541 states and 2386 transitions. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 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-19 23:01:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:27,974 INFO L93 Difference]: Finished difference Result 7559 states and 11679 transitions. [2024-11-19 23:01:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 23:01:27,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 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 314 [2024-11-19 23:01:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:27,998 INFO L225 Difference]: With dead ends: 7559 [2024-11-19 23:01:27,998 INFO L226 Difference]: Without dead ends: 6029 [2024-11-19 23:01:28,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 23:01:28,004 INFO L432 NwaCegarLoop]: 2457 mSDtfsCounter, 4673 mSDsluCounter, 3862 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 6319 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 23:01:28,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 6319 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:01:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2024-11-19 23:01:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 2874. [2024-11-19 23:01:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2862 states have (on average 1.555206149545772) internal successors, (4451), 2873 states have internal predecessors, (4451), 0 states have call successors, (0), 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-19 23:01:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 4451 transitions. [2024-11-19 23:01:28,086 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 4451 transitions. Word has length 314 [2024-11-19 23:01:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:28,087 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 4451 transitions. [2024-11-19 23:01:28,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 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-19 23:01:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 4451 transitions. [2024-11-19 23:01:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-19 23:01:28,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:28,093 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] [2024-11-19 23:01:28,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 23:01:28,093 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-19 23:01:28,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:28,095 INFO L85 PathProgramCache]: Analyzing trace with hash -170087591, now seen corresponding path program 1 times [2024-11-19 23:01:28,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:28,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126738483] [2024-11-19 23:01:28,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:28,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:28,344 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-19 23:01:28,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126738483] [2024-11-19 23:01:28,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126738483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:28,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:28,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:28,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500044024] [2024-11-19 23:01:28,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:28,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:28,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:28,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:28,347 INFO L87 Difference]: Start difference. First operand 2874 states and 4451 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-19 23:01:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:28,463 INFO L93 Difference]: Finished difference Result 8399 states and 12965 transitions. [2024-11-19 23:01:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:28,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 316 [2024-11-19 23:01:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:28,481 INFO L225 Difference]: With dead ends: 8399 [2024-11-19 23:01:28,481 INFO L226 Difference]: Without dead ends: 5650 [2024-11-19 23:01:28,487 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-19 23:01:28,488 INFO L432 NwaCegarLoop]: 2929 mSDtfsCounter, 1361 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 4366 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-19 23:01:28,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 4366 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:01:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2024-11-19 23:01:28,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 5495. [2024-11-19 23:01:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5495 states, 5483 states have (on average 1.5486047784059822) internal successors, (8491), 5494 states have internal predecessors, (8491), 0 states have call successors, (0), 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-19 23:01:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5495 states to 5495 states and 8491 transitions. [2024-11-19 23:01:28,611 INFO L78 Accepts]: Start accepts. Automaton has 5495 states and 8491 transitions. Word has length 316 [2024-11-19 23:01:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:28,611 INFO L471 AbstractCegarLoop]: Abstraction has 5495 states and 8491 transitions. [2024-11-19 23:01:28,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-19 23:01:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 5495 states and 8491 transitions. [2024-11-19 23:01:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-19 23:01:28,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:28,620 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] [2024-11-19 23:01:28,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 23:01:28,620 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-19 23:01:28,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash -295747938, now seen corresponding path program 1 times [2024-11-19 23:01:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:28,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198564186] [2024-11-19 23:01:28,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:28,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:28,766 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-19 23:01:28,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:28,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198564186] [2024-11-19 23:01:28,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198564186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:28,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:28,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:28,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883109125] [2024-11-19 23:01:28,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:28,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:28,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:28,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:28,769 INFO L87 Difference]: Start difference. First operand 5495 states and 8491 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-19 23:01:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:28,852 INFO L93 Difference]: Finished difference Result 16418 states and 25357 transitions. [2024-11-19 23:01:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:28,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 316 [2024-11-19 23:01:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:28,920 INFO L225 Difference]: With dead ends: 16418 [2024-11-19 23:01:28,921 INFO L226 Difference]: Without dead ends: 10961 [2024-11-19 23:01:28,925 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-19 23:01:28,926 INFO L432 NwaCegarLoop]: 2988 mSDtfsCounter, 1491 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 4480 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-19 23:01:28,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 4480 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:01:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10961 states. [2024-11-19 23:01:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10961 to 5514. [2024-11-19 23:01:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5514 states, 5502 states have (on average 1.5483460559796438) internal successors, (8519), 5513 states have internal predecessors, (8519), 0 states have call successors, (0), 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-19 23:01:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 8519 transitions. [2024-11-19 23:01:29,053 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 8519 transitions. Word has length 316 [2024-11-19 23:01:29,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:29,054 INFO L471 AbstractCegarLoop]: Abstraction has 5514 states and 8519 transitions. [2024-11-19 23:01:29,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-19 23:01:29,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 8519 transitions. [2024-11-19 23:01:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-11-19 23:01:29,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:29,062 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] [2024-11-19 23:01:29,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 23:01:29,062 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-19 23:01:29,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1035756933, now seen corresponding path program 1 times [2024-11-19 23:01:29,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:29,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766602634] [2024-11-19 23:01:29,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:29,193 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-19 23:01:29,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:29,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766602634] [2024-11-19 23:01:29,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766602634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:29,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:29,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:29,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594174728] [2024-11-19 23:01:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:29,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:29,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:29,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:29,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:29,195 INFO L87 Difference]: Start difference. First operand 5514 states and 8519 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-19 23:01:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:29,255 INFO L93 Difference]: Finished difference Result 10990 states and 16971 transitions. [2024-11-19 23:01:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:29,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 317 [2024-11-19 23:01:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:29,266 INFO L225 Difference]: With dead ends: 10990 [2024-11-19 23:01:29,266 INFO L226 Difference]: Without dead ends: 5532 [2024-11-19 23:01:29,273 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-19 23:01:29,274 INFO L432 NwaCegarLoop]: 1515 mSDtfsCounter, 5 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3015 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-19 23:01:29,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3015 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:01:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2024-11-19 23:01:29,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5532. [2024-11-19 23:01:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5532 states, 5520 states have (on average 1.5471014492753623) internal successors, (8540), 5531 states have internal predecessors, (8540), 0 states have call successors, (0), 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-19 23:01:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 8540 transitions. [2024-11-19 23:01:29,376 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 8540 transitions. Word has length 317 [2024-11-19 23:01:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:29,376 INFO L471 AbstractCegarLoop]: Abstraction has 5532 states and 8540 transitions. [2024-11-19 23:01:29,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-19 23:01:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 8540 transitions. [2024-11-19 23:01:29,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-19 23:01:29,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:29,385 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] [2024-11-19 23:01:29,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 23:01:29,385 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-19 23:01:29,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash 976828212, now seen corresponding path program 1 times [2024-11-19 23:01:29,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:29,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693547163] [2024-11-19 23:01:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:29,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:29,597 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-19 23:01:29,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:29,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693547163] [2024-11-19 23:01:29,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693547163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:29,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713726565] [2024-11-19 23:01:29,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:29,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:29,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:29,602 INFO L87 Difference]: Start difference. First operand 5532 states and 8540 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-19 23:01:29,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:29,709 INFO L93 Difference]: Finished difference Result 16065 states and 24717 transitions. [2024-11-19 23:01:29,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:29,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 318 [2024-11-19 23:01:29,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:29,733 INFO L225 Difference]: With dead ends: 16065 [2024-11-19 23:01:29,733 INFO L226 Difference]: Without dead ends: 10774 [2024-11-19 23:01:29,743 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-19 23:01:29,743 INFO L432 NwaCegarLoop]: 2936 mSDtfsCounter, 1355 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 4373 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-19 23:01:29,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 4373 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:01:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10774 states. [2024-11-19 23:01:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10774 to 10619. [2024-11-19 23:01:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10619 states, 10607 states have (on average 1.5374752521919488) internal successors, (16308), 10618 states have internal predecessors, (16308), 0 states have call successors, (0), 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-19 23:01:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10619 states to 10619 states and 16308 transitions. [2024-11-19 23:01:29,921 INFO L78 Accepts]: Start accepts. Automaton has 10619 states and 16308 transitions. Word has length 318 [2024-11-19 23:01:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:29,921 INFO L471 AbstractCegarLoop]: Abstraction has 10619 states and 16308 transitions. [2024-11-19 23:01:29,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-19 23:01:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 10619 states and 16308 transitions. [2024-11-19 23:01:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-19 23:01:29,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:29,935 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] [2024-11-19 23:01:29,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 23:01:29,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:29,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:29,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2079420463, now seen corresponding path program 1 times [2024-11-19 23:01:29,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:29,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861852672] [2024-11-19 23:01:29,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:29,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:30,863 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-19 23:01:30,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:30,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861852672] [2024-11-19 23:01:30,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861852672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:30,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:30,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 23:01:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145499536] [2024-11-19 23:01:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:30,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 23:01:30,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 23:01:30,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 23:01:30,866 INFO L87 Difference]: Start difference. First operand 10619 states and 16308 transitions. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 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-19 23:01:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:30,988 INFO L93 Difference]: Finished difference Result 30924 states and 47298 transitions. [2024-11-19 23:01:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 23:01:30,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 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 318 [2024-11-19 23:01:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:31,020 INFO L225 Difference]: With dead ends: 30924 [2024-11-19 23:01:31,021 INFO L226 Difference]: Without dead ends: 20841 [2024-11-19 23:01:31,037 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-19 23:01:31,037 INFO L432 NwaCegarLoop]: 2400 mSDtfsCounter, 1460 mSDsluCounter, 3892 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 6292 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-19 23:01:31,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 6292 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:01:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20841 states. [2024-11-19 23:01:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20841 to 10854. [2024-11-19 23:01:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10854 states, 10842 states have (on average 1.5399372809444751) internal successors, (16696), 10853 states have internal predecessors, (16696), 0 states have call successors, (0), 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-19 23:01:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10854 states to 10854 states and 16696 transitions. [2024-11-19 23:01:31,343 INFO L78 Accepts]: Start accepts. Automaton has 10854 states and 16696 transitions. Word has length 318 [2024-11-19 23:01:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:31,344 INFO L471 AbstractCegarLoop]: Abstraction has 10854 states and 16696 transitions. [2024-11-19 23:01:31,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 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-19 23:01:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 10854 states and 16696 transitions. [2024-11-19 23:01:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-11-19 23:01:31,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:31,356 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] [2024-11-19 23:01:31,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 23:01:31,357 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-19 23:01:31,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1999294816, now seen corresponding path program 1 times [2024-11-19 23:01:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209975174] [2024-11-19 23:01:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:31,477 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-19 23:01:31,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:31,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209975174] [2024-11-19 23:01:31,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209975174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:31,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:31,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:31,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32183358] [2024-11-19 23:01:31,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:31,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:31,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:31,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:31,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:31,479 INFO L87 Difference]: Start difference. First operand 10854 states and 16696 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-19 23:01:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:31,590 INFO L93 Difference]: Finished difference Result 31000 states and 47377 transitions. [2024-11-19 23:01:31,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:31,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 320 [2024-11-19 23:01:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:31,623 INFO L225 Difference]: With dead ends: 31000 [2024-11-19 23:01:31,623 INFO L226 Difference]: Without dead ends: 20945 [2024-11-19 23:01:31,639 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-19 23:01:31,640 INFO L432 NwaCegarLoop]: 2856 mSDtfsCounter, 1359 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 4347 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 23:01:31,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 4347 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:01:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20945 states. [2024-11-19 23:01:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20945 to 10958. [2024-11-19 23:01:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10958 states, 10946 states have (on average 1.5383701808879957) internal successors, (16839), 10957 states have internal predecessors, (16839), 0 states have call successors, (0), 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-19 23:01:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10958 states to 10958 states and 16839 transitions. [2024-11-19 23:01:31,855 INFO L78 Accepts]: Start accepts. Automaton has 10958 states and 16839 transitions. Word has length 320 [2024-11-19 23:01:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:31,855 INFO L471 AbstractCegarLoop]: Abstraction has 10958 states and 16839 transitions. [2024-11-19 23:01:31,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-19 23:01:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 10958 states and 16839 transitions. [2024-11-19 23:01:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-11-19 23:01:31,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:31,869 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] [2024-11-19 23:01:31,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 23:01:31,871 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-19 23:01:31,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:31,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1273208642, now seen corresponding path program 1 times [2024-11-19 23:01:31,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:31,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595963737] [2024-11-19 23:01:31,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:31,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:32,051 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-19 23:01:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595963737] [2024-11-19 23:01:32,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595963737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:32,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:32,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:32,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166604747] [2024-11-19 23:01:32,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:32,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:32,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:32,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:32,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:32,055 INFO L87 Difference]: Start difference. First operand 10958 states and 16839 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-19 23:01:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:32,165 INFO L93 Difference]: Finished difference Result 24679 states and 38077 transitions. [2024-11-19 23:01:32,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:32,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 320 [2024-11-19 23:01:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:32,191 INFO L225 Difference]: With dead ends: 24679 [2024-11-19 23:01:32,192 INFO L226 Difference]: Without dead ends: 15584 [2024-11-19 23:01:32,205 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-19 23:01:32,206 INFO L432 NwaCegarLoop]: 1982 mSDtfsCounter, 684 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 3247 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-19 23:01:32,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 3247 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:01:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15584 states. [2024-11-19 23:01:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15584 to 12910. [2024-11-19 23:01:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12910 states, 12898 states have (on average 1.55458210575283) internal successors, (20051), 12909 states have internal predecessors, (20051), 0 states have call successors, (0), 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-19 23:01:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12910 states to 12910 states and 20051 transitions. [2024-11-19 23:01:32,386 INFO L78 Accepts]: Start accepts. Automaton has 12910 states and 20051 transitions. Word has length 320 [2024-11-19 23:01:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:32,386 INFO L471 AbstractCegarLoop]: Abstraction has 12910 states and 20051 transitions. [2024-11-19 23:01:32,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-19 23:01:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 12910 states and 20051 transitions. [2024-11-19 23:01:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-19 23:01:32,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:32,401 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] [2024-11-19 23:01:32,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 23:01:32,402 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:32,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:32,402 INFO L85 PathProgramCache]: Analyzing trace with hash 581485409, now seen corresponding path program 1 times [2024-11-19 23:01:32,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:32,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559802731] [2024-11-19 23:01:32,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:32,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:32,530 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-19 23:01:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:32,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559802731] [2024-11-19 23:01:32,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559802731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:32,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:32,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542473831] [2024-11-19 23:01:32,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:32,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:32,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:32,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:32,535 INFO L87 Difference]: Start difference. First operand 12910 states and 20051 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:01:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:32,609 INFO L93 Difference]: Finished difference Result 25049 states and 38766 transitions. [2024-11-19 23:01:32,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:32,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2024-11-19 23:01:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:32,633 INFO L225 Difference]: With dead ends: 25049 [2024-11-19 23:01:32,634 INFO L226 Difference]: Without dead ends: 13035 [2024-11-19 23:01:32,649 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-19 23:01:32,651 INFO L432 NwaCegarLoop]: 1512 mSDtfsCounter, 5 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 23:01:32,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3008 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:01:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13035 states. [2024-11-19 23:01:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13035 to 13035. [2024-11-19 23:01:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13035 states, 13023 states have (on average 1.5508715349765798) internal successors, (20197), 13034 states have internal predecessors, (20197), 0 states have call successors, (0), 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-19 23:01:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13035 states to 13035 states and 20197 transitions. [2024-11-19 23:01:32,858 INFO L78 Accepts]: Start accepts. Automaton has 13035 states and 20197 transitions. Word has length 321 [2024-11-19 23:01:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:32,859 INFO L471 AbstractCegarLoop]: Abstraction has 13035 states and 20197 transitions. [2024-11-19 23:01:32,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:01:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 13035 states and 20197 transitions. [2024-11-19 23:01:32,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-19 23:01:32,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:32,873 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] [2024-11-19 23:01:32,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 23:01:32,873 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:32,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:32,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1982520492, now seen corresponding path program 1 times [2024-11-19 23:01:32,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:32,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679805414] [2024-11-19 23:01:32,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:32,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:33,009 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-19 23:01:33,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:33,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679805414] [2024-11-19 23:01:33,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679805414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:33,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:33,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37376178] [2024-11-19 23:01:33,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:33,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:33,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:33,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:33,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:33,012 INFO L87 Difference]: Start difference. First operand 13035 states and 20197 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:01:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:33,137 INFO L93 Difference]: Finished difference Result 29764 states and 46551 transitions. [2024-11-19 23:01:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:33,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2024-11-19 23:01:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:33,169 INFO L225 Difference]: With dead ends: 29764 [2024-11-19 23:01:33,169 INFO L226 Difference]: Without dead ends: 19029 [2024-11-19 23:01:33,182 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-19 23:01:33,183 INFO L432 NwaCegarLoop]: 1970 mSDtfsCounter, 686 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 3204 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-19 23:01:33,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 3204 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:01:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19029 states. [2024-11-19 23:01:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19029 to 16539. [2024-11-19 23:01:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16539 states, 16527 states have (on average 1.5698553881527197) internal successors, (25945), 16538 states have internal predecessors, (25945), 0 states have call successors, (0), 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-19 23:01:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16539 states to 16539 states and 25945 transitions. [2024-11-19 23:01:33,526 INFO L78 Accepts]: Start accepts. Automaton has 16539 states and 25945 transitions. Word has length 322 [2024-11-19 23:01:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:33,526 INFO L471 AbstractCegarLoop]: Abstraction has 16539 states and 25945 transitions. [2024-11-19 23:01:33,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:01:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 16539 states and 25945 transitions. [2024-11-19 23:01:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-19 23:01:33,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:33,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] [2024-11-19 23:01:33,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 23:01:33,548 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:33,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1681215469, now seen corresponding path program 1 times [2024-11-19 23:01:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:33,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711904871] [2024-11-19 23:01:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:33,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:34,338 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-19 23:01:34,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:34,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711904871] [2024-11-19 23:01:34,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711904871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:34,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:34,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 23:01:34,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120962046] [2024-11-19 23:01:34,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:34,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 23:01:34,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:34,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 23:01:34,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 23:01:34,340 INFO L87 Difference]: Start difference. First operand 16539 states and 25945 transitions. Second operand has 5 states, 5 states have (on average 64.4) internal successors, (322), 5 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:01:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:34,717 INFO L93 Difference]: Finished difference Result 80795 states and 126641 transitions. [2024-11-19 23:01:34,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 23:01:34,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 64.4) internal successors, (322), 5 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2024-11-19 23:01:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:34,833 INFO L225 Difference]: With dead ends: 80795 [2024-11-19 23:01:34,833 INFO L226 Difference]: Without dead ends: 64324 [2024-11-19 23:01:34,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 23:01:34,866 INFO L432 NwaCegarLoop]: 2517 mSDtfsCounter, 6000 mSDsluCounter, 3962 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6000 SdHoareTripleChecker+Valid, 6479 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 23:01:34,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6000 Valid, 6479 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:01:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64324 states. [2024-11-19 23:01:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64324 to 32068. [2024-11-19 23:01:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32068 states, 32056 states have (on average 1.5602695283254304) internal successors, (50016), 32067 states have internal predecessors, (50016), 0 states have call successors, (0), 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-19 23:01:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32068 states to 32068 states and 50016 transitions. [2024-11-19 23:01:35,553 INFO L78 Accepts]: Start accepts. Automaton has 32068 states and 50016 transitions. Word has length 322 [2024-11-19 23:01:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:35,553 INFO L471 AbstractCegarLoop]: Abstraction has 32068 states and 50016 transitions. [2024-11-19 23:01:35,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.4) internal successors, (322), 5 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:01:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32068 states and 50016 transitions. [2024-11-19 23:01:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-19 23:01:35,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:35,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] [2024-11-19 23:01:35,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 23:01:35,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:35,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1096716177, now seen corresponding path program 1 times [2024-11-19 23:01:35,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:35,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848771409] [2024-11-19 23:01:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:35,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:35,731 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-19 23:01:35,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848771409] [2024-11-19 23:01:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848771409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:35,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:35,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:35,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590949984] [2024-11-19 23:01:35,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:35,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:35,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:35,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:35,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:35,734 INFO L87 Difference]: Start difference. First operand 32068 states and 50016 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-19 23:01:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:35,986 INFO L93 Difference]: Finished difference Result 94090 states and 146500 transitions. [2024-11-19 23:01:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:35,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 324 [2024-11-19 23:01:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:36,272 INFO L225 Difference]: With dead ends: 94090 [2024-11-19 23:01:36,272 INFO L226 Difference]: Without dead ends: 62715 [2024-11-19 23:01:36,304 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-19 23:01:36,307 INFO L432 NwaCegarLoop]: 2869 mSDtfsCounter, 1328 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 4292 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-19 23:01:36,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 4292 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:01:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62715 states. [2024-11-19 23:01:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62715 to 62574. [2024-11-19 23:01:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62574 states, 62562 states have (on average 1.5507816246283685) internal successors, (97020), 62573 states have internal predecessors, (97020), 0 states have call successors, (0), 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-19 23:01:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62574 states to 62574 states and 97020 transitions. [2024-11-19 23:01:37,164 INFO L78 Accepts]: Start accepts. Automaton has 62574 states and 97020 transitions. Word has length 324 [2024-11-19 23:01:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:37,164 INFO L471 AbstractCegarLoop]: Abstraction has 62574 states and 97020 transitions. [2024-11-19 23:01:37,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-19 23:01:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 62574 states and 97020 transitions. [2024-11-19 23:01:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-19 23:01:37,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:37,199 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] [2024-11-19 23:01:37,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 23:01:37,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:37,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:37,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1799369966, now seen corresponding path program 1 times [2024-11-19 23:01:37,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:37,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230113510] [2024-11-19 23:01:37,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:37,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:38,199 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-19 23:01:38,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:38,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230113510] [2024-11-19 23:01:38,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230113510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:38,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:38,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 23:01:38,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912885533] [2024-11-19 23:01:38,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:38,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 23:01:38,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:38,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 23:01:38,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 23:01:38,201 INFO L87 Difference]: Start difference. First operand 62574 states and 97020 transitions. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 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-19 23:01:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:38,627 INFO L93 Difference]: Finished difference Result 183599 states and 284290 transitions. [2024-11-19 23:01:38,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 23:01:38,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 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 324 [2024-11-19 23:01:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:38,781 INFO L225 Difference]: With dead ends: 183599 [2024-11-19 23:01:38,781 INFO L226 Difference]: Without dead ends: 123420 [2024-11-19 23:01:38,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-19 23:01:38,843 INFO L432 NwaCegarLoop]: 2925 mSDtfsCounter, 1445 mSDsluCounter, 4411 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 7336 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 23:01:38,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 7336 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:01:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123420 states. [2024-11-19 23:01:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123420 to 63487. [2024-11-19 23:01:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63487 states, 63475 states have (on average 1.552674281213076) internal successors, (98556), 63486 states have internal predecessors, (98556), 0 states have call successors, (0), 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-19 23:01:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63487 states to 63487 states and 98556 transitions. [2024-11-19 23:01:40,213 INFO L78 Accepts]: Start accepts. Automaton has 63487 states and 98556 transitions. Word has length 324 [2024-11-19 23:01:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:40,213 INFO L471 AbstractCegarLoop]: Abstraction has 63487 states and 98556 transitions. [2024-11-19 23:01:40,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 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-19 23:01:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 63487 states and 98556 transitions. [2024-11-19 23:01:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-19 23:01:40,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:40,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] [2024-11-19 23:01:40,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 23:01:40,256 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:40,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash -299036699, now seen corresponding path program 1 times [2024-11-19 23:01:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:40,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906600673] [2024-11-19 23:01:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:40,444 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-19 23:01:40,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:40,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906600673] [2024-11-19 23:01:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906600673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:40,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:40,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:40,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232633038] [2024-11-19 23:01:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:40,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:40,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:40,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:40,447 INFO L87 Difference]: Start difference. First operand 63487 states and 98556 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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-19 23:01:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:41,140 INFO L93 Difference]: Finished difference Result 181655 states and 280823 transitions. [2024-11-19 23:01:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:41,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 325 [2024-11-19 23:01:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:41,283 INFO L225 Difference]: With dead ends: 181655 [2024-11-19 23:01:41,284 INFO L226 Difference]: Without dead ends: 122080 [2024-11-19 23:01:41,325 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-19 23:01:41,326 INFO L432 NwaCegarLoop]: 2773 mSDtfsCounter, 1339 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 4196 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-19 23:01:41,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 4196 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:01:41,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122080 states. [2024-11-19 23:01:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122080 to 121933. [2024-11-19 23:01:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121933 states, 121921 states have (on average 1.5390539775756433) internal successors, (187643), 121932 states have internal predecessors, (187643), 0 states have call successors, (0), 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-19 23:01:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121933 states to 121933 states and 187643 transitions. [2024-11-19 23:01:43,191 INFO L78 Accepts]: Start accepts. Automaton has 121933 states and 187643 transitions. Word has length 325 [2024-11-19 23:01:43,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:43,192 INFO L471 AbstractCegarLoop]: Abstraction has 121933 states and 187643 transitions. [2024-11-19 23:01:43,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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-19 23:01:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 121933 states and 187643 transitions. [2024-11-19 23:01:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-19 23:01:43,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:43,289 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] [2024-11-19 23:01:43,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 23:01:43,290 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:43,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1798541229, now seen corresponding path program 1 times [2024-11-19 23:01:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:43,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180243632] [2024-11-19 23:01:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:44,353 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-19 23:01:44,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:44,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180243632] [2024-11-19 23:01:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180243632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:44,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:44,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 23:01:44,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164911602] [2024-11-19 23:01:44,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:44,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 23:01:44,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:44,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 23:01:44,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 23:01:44,357 INFO L87 Difference]: Start difference. First operand 121933 states and 187643 transitions. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 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-19 23:01:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:44,812 INFO L93 Difference]: Finished difference Result 221131 states and 339783 transitions. [2024-11-19 23:01:44,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 23:01:44,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 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 326 [2024-11-19 23:01:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:44,946 INFO L225 Difference]: With dead ends: 221131 [2024-11-19 23:01:44,946 INFO L226 Difference]: Without dead ends: 104050 [2024-11-19 23:01:45,038 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-19 23:01:45,039 INFO L432 NwaCegarLoop]: 1636 mSDtfsCounter, 96 mSDsluCounter, 3127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 4763 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 23:01:45,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 4763 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:01:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104050 states. [2024-11-19 23:01:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104050 to 103628. [2024-11-19 23:01:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103628 states, 103616 states have (on average 1.5376872297714639) internal successors, (159329), 103627 states have internal predecessors, (159329), 0 states have call successors, (0), 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-19 23:01:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103628 states to 103628 states and 159329 transitions. [2024-11-19 23:01:46,669 INFO L78 Accepts]: Start accepts. Automaton has 103628 states and 159329 transitions. Word has length 326 [2024-11-19 23:01:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:46,669 INFO L471 AbstractCegarLoop]: Abstraction has 103628 states and 159329 transitions. [2024-11-19 23:01:46,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 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-19 23:01:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 103628 states and 159329 transitions. [2024-11-19 23:01:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-19 23:01:46,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:46,725 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] [2024-11-19 23:01:46,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 23:01:46,725 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:46,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1053098200, now seen corresponding path program 1 times [2024-11-19 23:01:46,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:46,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245614020] [2024-11-19 23:01:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:46,828 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-19 23:01:46,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:46,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245614020] [2024-11-19 23:01:46,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245614020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:46,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:46,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:46,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272553942] [2024-11-19 23:01:46,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:46,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:46,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:46,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:46,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:46,831 INFO L87 Difference]: Start difference. First operand 103628 states and 159329 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-19 23:01:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:48,028 INFO L93 Difference]: Finished difference Result 294559 states and 452283 transitions. [2024-11-19 23:01:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:48,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 329 [2024-11-19 23:01:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:48,355 INFO L225 Difference]: With dead ends: 294559 [2024-11-19 23:01:48,356 INFO L226 Difference]: Without dead ends: 199056 [2024-11-19 23:01:48,451 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-19 23:01:48,452 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 1346 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 2986 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-19 23:01:48,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 2986 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:01:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199056 states. [2024-11-19 23:01:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199056 to 104109. [2024-11-19 23:01:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104109 states, 104097 states have (on average 1.5363266952938126) internal successors, (159927), 104108 states have internal predecessors, (159927), 0 states have call successors, (0), 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-19 23:01:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104109 states to 104109 states and 159927 transitions. [2024-11-19 23:01:50,850 INFO L78 Accepts]: Start accepts. Automaton has 104109 states and 159927 transitions. Word has length 329 [2024-11-19 23:01:50,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:50,851 INFO L471 AbstractCegarLoop]: Abstraction has 104109 states and 159927 transitions. [2024-11-19 23:01:50,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-19 23:01:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 104109 states and 159927 transitions. [2024-11-19 23:01:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-19 23:01:50,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:50,908 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] [2024-11-19 23:01:50,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 23:01:50,908 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:50,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1560066029, now seen corresponding path program 1 times [2024-11-19 23:01:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:50,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731838895] [2024-11-19 23:01:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:51,034 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-19 23:01:51,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:51,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731838895] [2024-11-19 23:01:51,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731838895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:51,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:51,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:51,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88862813] [2024-11-19 23:01:51,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:51,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:51,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:51,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:51,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:51,036 INFO L87 Difference]: Start difference. First operand 104109 states and 159927 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-19 23:01:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:52,076 INFO L93 Difference]: Finished difference Result 252622 states and 393355 transitions. [2024-11-19 23:01:52,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:52,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 330 [2024-11-19 23:01:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:52,325 INFO L225 Difference]: With dead ends: 252622 [2024-11-19 23:01:52,325 INFO L226 Difference]: Without dead ends: 163056 [2024-11-19 23:01:52,381 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-19 23:01:52,383 INFO L432 NwaCegarLoop]: 2038 mSDtfsCounter, 761 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 23:01:52,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 3252 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:01:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163056 states. [2024-11-19 23:01:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163056 to 144361. [2024-11-19 23:01:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144361 states, 144349 states have (on average 1.55706655397682) internal successors, (224761), 144360 states have internal predecessors, (224761), 0 states have call successors, (0), 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-19 23:01:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144361 states to 144361 states and 224761 transitions. [2024-11-19 23:01:55,107 INFO L78 Accepts]: Start accepts. Automaton has 144361 states and 224761 transitions. Word has length 330 [2024-11-19 23:01:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:01:55,108 INFO L471 AbstractCegarLoop]: Abstraction has 144361 states and 224761 transitions. [2024-11-19 23:01:55,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-19 23:01:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 144361 states and 224761 transitions. [2024-11-19 23:01:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-19 23:01:55,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:01:55,163 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] [2024-11-19 23:01:55,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 23:01:55,163 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:01:55,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:01:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1991484171, now seen corresponding path program 1 times [2024-11-19 23:01:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:01:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237992905] [2024-11-19 23:01:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:01:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:01:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:01:55,284 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-19 23:01:55,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:01:55,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237992905] [2024-11-19 23:01:55,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237992905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:01:55,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:01:55,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:01:55,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690889559] [2024-11-19 23:01:55,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:01:55,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:01:55,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:01:55,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:01:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:01:55,287 INFO L87 Difference]: Start difference. First operand 144361 states and 224761 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:01:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:01:56,653 INFO L93 Difference]: Finished difference Result 369178 states and 580477 transitions. [2024-11-19 23:01:56,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:01:56,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2024-11-19 23:01:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:01:57,012 INFO L225 Difference]: With dead ends: 369178 [2024-11-19 23:01:57,012 INFO L226 Difference]: Without dead ends: 237347 [2024-11-19 23:01:57,078 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-19 23:01:57,079 INFO L432 NwaCegarLoop]: 1951 mSDtfsCounter, 658 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 23:01:57,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 3199 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:01:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237347 states. [2024-11-19 23:02:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237347 to 216053. [2024-11-19 23:02:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216053 states, 216041 states have (on average 1.5775986965437117) internal successors, (340826), 216052 states have internal predecessors, (340826), 0 states have call successors, (0), 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-19 23:02:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216053 states to 216053 states and 340826 transitions. [2024-11-19 23:02:01,292 INFO L78 Accepts]: Start accepts. Automaton has 216053 states and 340826 transitions. Word has length 331 [2024-11-19 23:02:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:02:01,293 INFO L471 AbstractCegarLoop]: Abstraction has 216053 states and 340826 transitions. [2024-11-19 23:02:01,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:02:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 216053 states and 340826 transitions. [2024-11-19 23:02:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-19 23:02:01,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:02:01,338 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] [2024-11-19 23:02:01,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 23:02:01,338 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:02:01,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:02:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1132848270, now seen corresponding path program 1 times [2024-11-19 23:02:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:02:01,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522513095] [2024-11-19 23:02:01,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:02:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:02:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:02:01,560 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-19 23:02:01,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:02:01,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522513095] [2024-11-19 23:02:01,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522513095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:02:01,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:02:01,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 23:02:01,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190871035] [2024-11-19 23:02:01,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:02:01,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 23:02:01,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:02:01,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 23:02:01,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 23:02:01,562 INFO L87 Difference]: Start difference. First operand 216053 states and 340826 transitions. Second operand has 5 states, 5 states have (on average 66.2) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:02:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:02:03,368 INFO L93 Difference]: Finished difference Result 420546 states and 664564 transitions. [2024-11-19 23:02:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 23:02:03,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.2) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2024-11-19 23:02:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:02:03,752 INFO L225 Difference]: With dead ends: 420546 [2024-11-19 23:02:03,753 INFO L226 Difference]: Without dead ends: 216053 [2024-11-19 23:02:03,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:02:03,872 INFO L432 NwaCegarLoop]: 1168 mSDtfsCounter, 3761 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3761 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 23:02:03,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3761 Valid, 1721 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 23:02:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216053 states. [2024-11-19 23:02:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216053 to 216053. [2024-11-19 23:02:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216053 states, 216041 states have (on average 1.5665174665919894) internal successors, (338432), 216052 states have internal predecessors, (338432), 0 states have call successors, (0), 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-19 23:02:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216053 states to 216053 states and 338432 transitions. [2024-11-19 23:02:07,955 INFO L78 Accepts]: Start accepts. Automaton has 216053 states and 338432 transitions. Word has length 331 [2024-11-19 23:02:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:02:07,955 INFO L471 AbstractCegarLoop]: Abstraction has 216053 states and 338432 transitions. [2024-11-19 23:02:07,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.2) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:02:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 216053 states and 338432 transitions. [2024-11-19 23:02:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-19 23:02:08,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:02:08,035 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] [2024-11-19 23:02:08,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 23:02:08,035 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-19 23:02:08,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:02:08,036 INFO L85 PathProgramCache]: Analyzing trace with hash 169502345, now seen corresponding path program 1 times [2024-11-19 23:02:08,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:02:08,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892368157] [2024-11-19 23:02:08,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:02:08,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:02:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:02:08,419 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-19 23:02:08,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:02:08,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892368157] [2024-11-19 23:02:08,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892368157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:02:08,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:02:08,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:02:08,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189558963] [2024-11-19 23:02:08,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:02:08,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 23:02:08,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:02:08,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 23:02:08,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 23:02:08,422 INFO L87 Difference]: Start difference. First operand 216053 states and 338432 transitions. Second operand has 8 states, 8 states have (on average 41.375) internal successors, (331), 7 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)