./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:01:23,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:01:23,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:01:23,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:01:23,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:01:23,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:01:23,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:01:23,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:01:23,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:01:23,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:01:23,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:01:23,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:01:23,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:01:23,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:01:23,762 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:01:23,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:01:23,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:01:23,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:01:23,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:01:23,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:01:23,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:01:23,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:01:23,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:01:23,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:01:23,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:01:23,765 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:01:23,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:01:23,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:01:23,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:01:23,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:01:23,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:01:23,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:01:23,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:01:23,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:01:23,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:01:23,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:01:23,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:01:23,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:01:23,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:01:23,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:01:23,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:01:23,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:01:23,771 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 -> 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd [2024-11-10 00:01:24,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:01:24,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:01:24,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:01:24,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:01:24,122 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:01:24,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-10 00:01:25,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:01:25,978 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:01:25,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-10 00:01:26,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f534c9d5/5bd0dd7bbf9044bc9bcedef56c24ba38/FLAG252b36dbb [2024-11-10 00:01:26,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f534c9d5/5bd0dd7bbf9044bc9bcedef56c24ba38 [2024-11-10 00:01:26,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:01:26,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:01:26,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:01:26,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:01:26,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:01:26,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:01:26" (1/1) ... [2024-11-10 00:01:26,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb02aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:26, skipping insertion in model container [2024-11-10 00:01:26,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:01:26" (1/1) ... [2024-11-10 00:01:26,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:01:26,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2024-11-10 00:01:26,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2024-11-10 00:01:26,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2024-11-10 00:01:26,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2024-11-10 00:01:26,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2024-11-10 00:01:26,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2024-11-10 00:01:26,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2024-11-10 00:01:26,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2024-11-10 00:01:26,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2024-11-10 00:01:26,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2024-11-10 00:01:26,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2024-11-10 00:01:26,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2024-11-10 00:01:26,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2024-11-10 00:01:26,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2024-11-10 00:01:26,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2024-11-10 00:01:26,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2024-11-10 00:01:26,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:01:26,919 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:01:26,973 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2024-11-10 00:01:26,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2024-11-10 00:01:26,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2024-11-10 00:01:26,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2024-11-10 00:01:27,044 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2024-11-10 00:01:27,055 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2024-11-10 00:01:27,067 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2024-11-10 00:01:27,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2024-11-10 00:01:27,079 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2024-11-10 00:01:27,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2024-11-10 00:01:27,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2024-11-10 00:01:27,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2024-11-10 00:01:27,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2024-11-10 00:01:27,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2024-11-10 00:01:27,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2024-11-10 00:01:27,178 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2024-11-10 00:01:27,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:01:27,313 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:01:27,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27 WrapperNode [2024-11-10 00:01:27,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:01:27,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:01:27,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:01:27,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:01:27,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,479 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3577 [2024-11-10 00:01:27,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:01:27,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:01:27,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:01:27,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:01:27,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,573 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-10 00:01:27,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:01:27,686 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:01:27,686 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:01:27,686 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:01:27,687 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (1/1) ... [2024-11-10 00:01:27,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:01:27,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:01:27,727 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-10 00:01:27,731 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-10 00:01:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:01:27,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:01:27,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:01:27,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:01:28,021 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:01:28,023 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:01:30,455 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4067: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1; [2024-11-10 00:01:30,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4067: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1; [2024-11-10 00:01:30,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4067: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1; [2024-11-10 00:01:30,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4067: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1; [2024-11-10 00:01:30,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1426: havoc main_~node3__m3~3#1; [2024-11-10 00:01:30,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4532: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2024-11-10 00:01:30,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4532: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2024-11-10 00:01:30,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4532: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2024-11-10 00:01:30,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4532: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2024-11-10 00:01:30,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2551: havoc main_~node5__m5~14#1; [2024-11-10 00:01:30,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5524: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2024-11-10 00:01:30,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2685: havoc main_~check__tmp~26#1;havoc main_~node5__m5~15#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2685: havoc main_~check__tmp~26#1;havoc main_~node5__m5~15#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2685: havoc main_~check__tmp~26#1;havoc main_~node5__m5~15#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2685: havoc main_~check__tmp~26#1;havoc main_~node5__m5~15#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4601: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4601: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4601: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4601: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2289: havoc main_~node4__m4~7#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2025: havoc main_~node5__m5~10#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1629: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4338: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1;havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1;havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2621: havoc main_~check__tmp~25#1; [2024-11-10 00:01:30,457 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5066: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2024-11-10 00:01:30,458 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5066: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2024-11-10 00:01:30,458 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5066: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2024-11-10 00:01:30,458 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5066: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2024-11-10 00:01:30,458 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~node4____CPAchecker_TMP_0~1#1; [2024-11-10 00:01:30,458 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4868: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2024-11-10 00:01:30,458 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4868: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2024-11-10 00:01:30,458 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4868: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2024-11-10 00:01:30,459 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4868: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2024-11-10 00:01:30,459 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-10 00:01:30,459 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-10 00:01:30,459 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-10 00:01:30,460 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2162: havoc main_~node5__m5~11#1; [2024-11-10 00:01:30,460 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5135: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1; [2024-11-10 00:01:30,460 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5135: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1; [2024-11-10 00:01:30,460 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5135: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1; [2024-11-10 00:01:30,460 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5135: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1; [2024-11-10 00:01:30,460 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4937: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2024-11-10 00:01:30,460 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4937: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2024-11-10 00:01:30,460 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4937: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2024-11-10 00:01:30,461 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4937: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2024-11-10 00:01:30,461 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L974: havoc main_~node5__m5~3#1; [2024-11-10 00:01:30,461 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4674: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1;havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2024-11-10 00:01:30,461 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,461 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,461 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,462 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,462 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,463 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,463 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,463 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,463 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,463 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,463 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,464 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,464 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,464 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,464 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,464 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,464 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,465 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,465 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,465 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,465 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,465 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,465 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,465 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,466 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,466 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,466 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,466 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,466 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,466 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:01:30,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2024-11-10 00:01:30,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5402: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2024-11-10 00:01:30,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5402: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2024-11-10 00:01:30,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5402: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2024-11-10 00:01:30,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5402: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2024-11-10 00:01:30,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2760: havoc main_~node4__m4~9#1; [2024-11-10 00:01:30,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2232: havoc main_~check__tmp~20#1; [2024-11-10 00:01:30,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3092: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2024-11-10 00:01:30,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L846: havoc main_~node1____CPAchecker_TMP_0~1#1; [2024-11-10 00:01:30,468 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1771: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2024-11-10 00:01:30,468 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1441: havoc main_~node4__m4~4#1; [2024-11-10 00:01:30,468 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2024-11-10 00:01:30,468 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2024-11-10 00:01:30,468 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2024-11-10 00:01:30,468 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2024-11-10 00:01:30,468 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: havoc main_~node2__m2~1#1; [2024-11-10 00:01:30,469 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3820: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2024-11-10 00:01:30,469 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3820: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2024-11-10 00:01:30,469 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3820: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2024-11-10 00:01:30,469 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3820: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2024-11-10 00:01:30,469 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-10 00:01:30,469 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-10 00:01:30,469 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-10 00:01:30,469 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3889: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1; [2024-11-10 00:01:30,470 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3889: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1; [2024-11-10 00:01:30,473 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3889: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1; [2024-11-10 00:01:30,473 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3889: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1; [2024-11-10 00:01:30,474 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2304: havoc main_~node5__m5~12#1; [2024-11-10 00:01:30,474 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3626: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1;havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2024-11-10 00:01:30,474 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3428: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2024-11-10 00:01:30,474 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc main_~check__tmp~23#1;havoc main_~node5__m5~13#1; [2024-11-10 00:01:30,474 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc main_~check__tmp~23#1;havoc main_~node5__m5~13#1; [2024-11-10 00:01:30,474 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc main_~check__tmp~23#1;havoc main_~node5__m5~13#1; [2024-11-10 00:01:30,474 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc main_~check__tmp~23#1;havoc main_~node5__m5~13#1; [2024-11-10 00:01:30,474 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4156: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2024-11-10 00:01:30,474 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4156: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2024-11-10 00:01:30,474 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4156: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2024-11-10 00:01:30,474 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4156: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: havoc main_~check__tmp~22#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4225: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4225: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4225: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4225: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1980: havoc main_~node2__m2~3#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3962: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1;havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1188: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-10 00:01:30,475 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1188: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1188: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3039: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3039: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3039: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3039: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L661: havoc main_~node5____CPAchecker_TMP_0~1#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L926: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L926: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L926: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1720: havoc main_~node4__m4~5#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1456: havoc main_~node5__m5~6#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L399: havoc main_~node3__m3~1#1; [2024-11-10 00:01:30,476 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3306: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~31#1; [2024-11-10 00:01:30,477 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3306: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~31#1; [2024-11-10 00:01:30,477 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3306: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~31#1; [2024-11-10 00:01:30,477 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3306: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~31#1; [2024-11-10 00:01:30,477 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L796: havoc main_~node2____CPAchecker_TMP_0~1#1; [2024-11-10 00:01:30,477 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4496: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2024-11-10 00:01:30,477 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5224: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2024-11-10 00:01:30,477 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5224: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2024-11-10 00:01:30,478 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5224: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2024-11-10 00:01:30,478 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5224: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2024-11-10 00:01:30,478 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3375: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~32#1; [2024-11-10 00:01:30,479 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3375: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~32#1; [2024-11-10 00:01:30,479 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3375: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~32#1; [2024-11-10 00:01:30,480 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3375: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~32#1; [2024-11-10 00:01:30,480 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129: havoc main_~node4__m4~3#1; [2024-11-10 00:01:30,480 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2120: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2024-11-10 00:01:30,480 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1593: havoc main_~node5__m5~7#1; [2024-11-10 00:01:30,480 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5293: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1; [2024-11-10 00:01:30,480 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5293: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1; [2024-11-10 00:01:30,480 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5293: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1; [2024-11-10 00:01:30,480 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5293: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1; [2024-11-10 00:01:30,481 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5030: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1;havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1;havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2024-11-10 00:01:30,481 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4832: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2024-11-10 00:01:30,481 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2587: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2024-11-10 00:01:30,481 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2521: havoc main_~node3__m3~5#1; [2024-11-10 00:01:30,481 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5560: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2024-11-10 00:01:30,481 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5560: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2024-11-10 00:01:30,481 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5560: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2024-11-10 00:01:30,481 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5560: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2024-11-10 00:01:30,481 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1663: havoc main_~check__tmp~13#1; [2024-11-10 00:01:30,482 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2024-11-10 00:01:30,482 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1995: havoc main_~node3__m3~4#1; [2024-11-10 00:01:30,482 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5629: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1; [2024-11-10 00:01:30,482 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5629: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1; [2024-11-10 00:01:30,482 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5629: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1; [2024-11-10 00:01:30,482 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5629: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1; [2024-11-10 00:01:30,482 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2024-11-10 00:01:30,482 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2024-11-10 00:01:30,482 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2024-11-10 00:01:30,483 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2024-11-10 00:01:30,483 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5366: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1;havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2024-11-10 00:01:30,483 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2857: havoc main_~node5__m5~17#1; [2024-11-10 00:01:30,483 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4443: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2024-11-10 00:01:30,483 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4443: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2024-11-10 00:01:30,483 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4443: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2024-11-10 00:01:30,483 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4443: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2024-11-10 00:01:30,483 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1735: havoc main_~node5__m5~8#1; [2024-11-10 00:01:30,483 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L414: havoc main_~node4__m4~1#1; [2024-11-10 00:01:30,483 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2198: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2024-11-10 00:01:30,483 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3784: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2024-11-10 00:01:30,484 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1869: havoc main_~check__tmp~16#1;havoc main_~node5__m5~9#1; [2024-11-10 00:01:30,484 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1869: havoc main_~check__tmp~16#1;havoc main_~node5__m5~9#1; [2024-11-10 00:01:30,484 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1869: havoc main_~check__tmp~16#1;havoc main_~node5__m5~9#1; [2024-11-10 00:01:30,484 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1869: havoc main_~check__tmp~16#1;havoc main_~node5__m5~9#1; [2024-11-10 00:01:30,484 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4710: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2024-11-10 00:01:30,484 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4710: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2024-11-10 00:01:30,484 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4710: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4710: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1144: havoc main_~node5__m5~4#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2069: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2069: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2069: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2024-11-10 00:01:30,485 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805: havoc main_~check__tmp~15#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4779: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4779: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4779: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4779: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3128: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3128: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3128: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3128: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4120: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc main_~node3____CPAchecker_TMP_0~1#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2800: havoc main_~check__tmp~27#1;havoc main_~node5__m5~16#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2800: havoc main_~check__tmp~27#1;havoc main_~node5__m5~16#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2800: havoc main_~check__tmp~27#1;havoc main_~node5__m5~16#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2800: havoc main_~check__tmp~27#1;havoc main_~node5__m5~16#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2536: havoc main_~node4__m4~8#1; [2024-11-10 00:01:30,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1281: havoc main_~node5__m5~5#1; [2024-11-10 00:01:30,487 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2024-11-10 00:01:30,487 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2024-11-10 00:01:30,487 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2024-11-10 00:01:30,487 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2024-11-10 00:01:30,487 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-10 00:01:30,487 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-10 00:01:30,487 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-10 00:01:30,489 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2340: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2024-11-10 00:01:30,489 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2010: havoc main_~node4__m4~6#1; [2024-11-10 00:01:30,489 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3662: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2024-11-10 00:01:30,490 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3662: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2024-11-10 00:01:30,490 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3662: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2024-11-10 00:01:30,491 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3662: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2024-11-10 00:01:30,491 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3464: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~33#1; [2024-11-10 00:01:30,491 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3464: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~33#1; [2024-11-10 00:01:30,491 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3464: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~33#1; [2024-11-10 00:01:30,491 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3464: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~33#1; [2024-11-10 00:01:30,491 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1351: havoc main_~check__tmp~9#1; [2024-11-10 00:01:30,491 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1; [2024-11-10 00:01:30,492 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1; [2024-11-10 00:01:30,492 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1; [2024-11-10 00:01:30,492 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1; [2024-11-10 00:01:30,492 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1551: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2024-11-10 00:01:30,492 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3533: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1; [2024-11-10 00:01:30,492 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3533: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1; [2024-11-10 00:01:30,492 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3533: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1; [2024-11-10 00:01:30,492 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3533: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1; [2024-11-10 00:01:30,493 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L362: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:30,493 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L362: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:30,493 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L362: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:30,493 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L362: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:01:30,493 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L429: havoc main_~node5__m5~1#1; [2024-11-10 00:01:30,493 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3270: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1;havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2024-11-10 00:01:30,493 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3998: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2024-11-10 00:01:30,493 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3998: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2024-11-10 00:01:30,494 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3998: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2024-11-10 00:01:30,494 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3998: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2024-11-10 00:01:30,494 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5188: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2024-11-10 00:01:30,657 INFO L? ?]: Removed 539 outVars from TransFormulas that were not future-live. [2024-11-10 00:01:30,657 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:01:30,697 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:01:30,699 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:01:30,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:01:30 BoogieIcfgContainer [2024-11-10 00:01:30,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:01:30,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:01:30,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:01:30,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:01:30,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:01:26" (1/3) ... [2024-11-10 00:01:30,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162c36bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:01:30, skipping insertion in model container [2024-11-10 00:01:30,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:27" (2/3) ... [2024-11-10 00:01:30,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162c36bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:01:30, skipping insertion in model container [2024-11-10 00:01:30,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:01:30" (3/3) ... [2024-11-10 00:01:30,710 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-10 00:01:30,732 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:01:30,732 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-10 00:01:30,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:01:30,837 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;@8c034b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:01:30,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 00:01:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 648 states, 631 states have (on average 1.820919175911252) internal successors, (1149), 647 states have internal predecessors, (1149), 0 states have call successors, (0), 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-10 00:01:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:01:30,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:30,876 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] [2024-11-10 00:01:30,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:30,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1939394412, now seen corresponding path program 1 times [2024-11-10 00:01:30,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:30,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231771310] [2024-11-10 00:01:30,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:31,552 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-10 00:01:31,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:31,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231771310] [2024-11-10 00:01:31,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231771310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:31,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:31,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:01:31,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013144351] [2024-11-10 00:01:31,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:31,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:01:31,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:31,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:01:31,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:01:31,592 INFO L87 Difference]: Start difference. First operand has 648 states, 631 states have (on average 1.820919175911252) internal successors, (1149), 647 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:32,173 INFO L93 Difference]: Finished difference Result 999 states and 1714 transitions. [2024-11-10 00:01:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:01:32,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:01:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:32,192 INFO L225 Difference]: With dead ends: 999 [2024-11-10 00:01:32,192 INFO L226 Difference]: Without dead ends: 504 [2024-11-10 00:01:32,199 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-10 00:01:32,205 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 2544 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2544 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:32,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2544 Valid, 609 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:01:32,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-10 00:01:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2024-11-10 00:01:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 488 states have (on average 1.3073770491803278) internal successors, (638), 503 states have internal predecessors, (638), 0 states have call successors, (0), 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-10 00:01:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 638 transitions. [2024-11-10 00:01:32,293 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 638 transitions. Word has length 71 [2024-11-10 00:01:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:32,293 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 638 transitions. [2024-11-10 00:01:32,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:32,294 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 638 transitions. [2024-11-10 00:01:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 00:01:32,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:32,297 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] [2024-11-10 00:01:32,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:01:32,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:32,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:32,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1454088448, now seen corresponding path program 1 times [2024-11-10 00:01:32,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:32,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612851657] [2024-11-10 00:01:32,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:32,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:32,526 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-10 00:01:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612851657] [2024-11-10 00:01:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612851657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:32,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:32,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:01:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876644883] [2024-11-10 00:01:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:32,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:01:32,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:32,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:01:32,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:01:32,532 INFO L87 Difference]: Start difference. First operand 504 states and 638 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:32,888 INFO L93 Difference]: Finished difference Result 846 states and 1099 transitions. [2024-11-10 00:01:32,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:01:32,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-10 00:01:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:32,891 INFO L225 Difference]: With dead ends: 846 [2024-11-10 00:01:32,894 INFO L226 Difference]: Without dead ends: 452 [2024-11-10 00:01:32,895 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-10 00:01:32,899 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 1648 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:32,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 348 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:01:32,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-10 00:01:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2024-11-10 00:01:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 436 states have (on average 1.323394495412844) internal successors, (577), 451 states have internal predecessors, (577), 0 states have call successors, (0), 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-10 00:01:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 577 transitions. [2024-11-10 00:01:32,932 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 577 transitions. Word has length 72 [2024-11-10 00:01:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:32,933 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 577 transitions. [2024-11-10 00:01:32,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 577 transitions. [2024-11-10 00:01:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:01:32,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:32,939 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] [2024-11-10 00:01:32,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:01:32,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:32,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:32,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1967357860, now seen corresponding path program 1 times [2024-11-10 00:01:32,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:32,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511445628] [2024-11-10 00:01:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:32,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:33,251 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-10 00:01:33,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:33,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511445628] [2024-11-10 00:01:33,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511445628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:33,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:33,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:01:33,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65205977] [2024-11-10 00:01:33,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:33,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:01:33,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:33,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:01:33,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:01:33,255 INFO L87 Difference]: Start difference. First operand 452 states and 577 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:33,564 INFO L93 Difference]: Finished difference Result 794 states and 1037 transitions. [2024-11-10 00:01:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:01:33,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 00:01:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:33,571 INFO L225 Difference]: With dead ends: 794 [2024-11-10 00:01:33,571 INFO L226 Difference]: Without dead ends: 417 [2024-11-10 00:01:33,572 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-10 00:01:33,574 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1554 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:33,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 325 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:01:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-10 00:01:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2024-11-10 00:01:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 401 states have (on average 1.339152119700748) internal successors, (537), 416 states have internal predecessors, (537), 0 states have call successors, (0), 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-10 00:01:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 537 transitions. [2024-11-10 00:01:33,596 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 537 transitions. Word has length 73 [2024-11-10 00:01:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:33,596 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 537 transitions. [2024-11-10 00:01:33,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 537 transitions. [2024-11-10 00:01:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 00:01:33,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:33,599 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] [2024-11-10 00:01:33,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:01:33,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:33,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2115509764, now seen corresponding path program 1 times [2024-11-10 00:01:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:33,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495215135] [2024-11-10 00:01:33,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:33,796 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-10 00:01:33,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:33,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495215135] [2024-11-10 00:01:33,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495215135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:33,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:33,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:01:33,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647097029] [2024-11-10 00:01:33,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:33,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:01:33,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:33,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:01:33,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:01:33,799 INFO L87 Difference]: Start difference. First operand 417 states and 537 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:34,063 INFO L93 Difference]: Finished difference Result 759 states and 996 transitions. [2024-11-10 00:01:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:01:34,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-10 00:01:34,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:34,065 INFO L225 Difference]: With dead ends: 759 [2024-11-10 00:01:34,066 INFO L226 Difference]: Without dead ends: 401 [2024-11-10 00:01:34,066 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-10 00:01:34,067 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 1484 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:34,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 315 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:01:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-10 00:01:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2024-11-10 00:01:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3454545454545455) internal successors, (518), 400 states have internal predecessors, (518), 0 states have call successors, (0), 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-10 00:01:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 518 transitions. [2024-11-10 00:01:34,078 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 518 transitions. Word has length 74 [2024-11-10 00:01:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:34,078 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 518 transitions. [2024-11-10 00:01:34,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 518 transitions. [2024-11-10 00:01:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:01:34,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:34,080 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] [2024-11-10 00:01:34,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:01:34,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:34,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 688000542, now seen corresponding path program 1 times [2024-11-10 00:01:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679525543] [2024-11-10 00:01:34,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:34,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:34,296 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-10 00:01:34,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:34,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679525543] [2024-11-10 00:01:34,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679525543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:34,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:34,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:01:34,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422987515] [2024-11-10 00:01:34,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:34,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:01:34,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:34,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:01:34,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:01:34,301 INFO L87 Difference]: Start difference. First operand 401 states and 518 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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-10 00:01:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:34,638 INFO L93 Difference]: Finished difference Result 743 states and 976 transitions. [2024-11-10 00:01:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:01:34,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-11-10 00:01:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:34,641 INFO L225 Difference]: With dead ends: 743 [2024-11-10 00:01:34,641 INFO L226 Difference]: Without dead ends: 396 [2024-11-10 00:01:34,642 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-10 00:01:34,643 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 1429 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1429 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:34,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1429 Valid, 288 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:01:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-10 00:01:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-10 00:01:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3447368421052632) internal successors, (511), 395 states have internal predecessors, (511), 0 states have call successors, (0), 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-10 00:01:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 511 transitions. [2024-11-10 00:01:34,653 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 511 transitions. Word has length 75 [2024-11-10 00:01:34,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:34,653 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 511 transitions. [2024-11-10 00:01:34,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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-10 00:01:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 511 transitions. [2024-11-10 00:01:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 00:01:34,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:34,655 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] [2024-11-10 00:01:34,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:01:34,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:34,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash -459754016, now seen corresponding path program 1 times [2024-11-10 00:01:34,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:34,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525273964] [2024-11-10 00:01:34,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:35,061 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-10 00:01:35,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:35,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525273964] [2024-11-10 00:01:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525273964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:35,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:35,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:35,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099214532] [2024-11-10 00:01:35,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:35,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:01:35,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:35,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:01:35,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:01:35,068 INFO L87 Difference]: Start difference. First operand 396 states and 511 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-10 00:01:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:35,717 INFO L93 Difference]: Finished difference Result 771 states and 979 transitions. [2024-11-10 00:01:35,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:01:35,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-10 00:01:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:35,720 INFO L225 Difference]: With dead ends: 771 [2024-11-10 00:01:35,720 INFO L226 Difference]: Without dead ends: 554 [2024-11-10 00:01:35,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:01:35,722 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 1789 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:35,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 919 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:01:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-10 00:01:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 396. [2024-11-10 00:01:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3421052631578947) internal successors, (510), 395 states have internal predecessors, (510), 0 states have call successors, (0), 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-10 00:01:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 510 transitions. [2024-11-10 00:01:35,736 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 510 transitions. Word has length 76 [2024-11-10 00:01:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:35,737 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 510 transitions. [2024-11-10 00:01:35,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-10 00:01:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 510 transitions. [2024-11-10 00:01:35,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 00:01:35,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:35,741 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] [2024-11-10 00:01:35,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:01:35,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:35,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:35,742 INFO L85 PathProgramCache]: Analyzing trace with hash 120227150, now seen corresponding path program 1 times [2024-11-10 00:01:35,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:35,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828717726] [2024-11-10 00:01:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:36,187 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-10 00:01:36,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:36,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828717726] [2024-11-10 00:01:36,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828717726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:36,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:36,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:36,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867780700] [2024-11-10 00:01:36,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:36,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:36,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:36,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:36,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:36,190 INFO L87 Difference]: Start difference. First operand 396 states and 510 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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-10 00:01:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:37,154 INFO L93 Difference]: Finished difference Result 749 states and 983 transitions. [2024-11-10 00:01:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:37,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-10 00:01:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:37,157 INFO L225 Difference]: With dead ends: 749 [2024-11-10 00:01:37,158 INFO L226 Difference]: Without dead ends: 616 [2024-11-10 00:01:37,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-10 00:01:37,159 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 2157 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2157 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:37,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 2073 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 00:01:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-10 00:01:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 396. [2024-11-10 00:01:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3394736842105264) internal successors, (509), 395 states have internal predecessors, (509), 0 states have call successors, (0), 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-10 00:01:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 509 transitions. [2024-11-10 00:01:37,170 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 509 transitions. Word has length 76 [2024-11-10 00:01:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:37,170 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 509 transitions. [2024-11-10 00:01:37,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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-10 00:01:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 509 transitions. [2024-11-10 00:01:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 00:01:37,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:37,173 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] [2024-11-10 00:01:37,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:01:37,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:37,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash -740235363, now seen corresponding path program 1 times [2024-11-10 00:01:37,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666513059] [2024-11-10 00:01:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:37,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:37,526 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-10 00:01:37,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:37,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666513059] [2024-11-10 00:01:37,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666513059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:37,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:37,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:37,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27813019] [2024-11-10 00:01:37,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:37,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:37,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:37,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:37,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:37,529 INFO L87 Difference]: Start difference. First operand 396 states and 509 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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-10 00:01:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:38,266 INFO L93 Difference]: Finished difference Result 706 states and 927 transitions. [2024-11-10 00:01:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:38,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-10 00:01:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:38,270 INFO L225 Difference]: With dead ends: 706 [2024-11-10 00:01:38,270 INFO L226 Difference]: Without dead ends: 612 [2024-11-10 00:01:38,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-10 00:01:38,271 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 1944 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:38,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1944 Valid, 1480 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-10 00:01:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 396. [2024-11-10 00:01:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3368421052631578) internal successors, (508), 395 states have internal predecessors, (508), 0 states have call successors, (0), 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-10 00:01:38,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 508 transitions. [2024-11-10 00:01:38,283 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 508 transitions. Word has length 76 [2024-11-10 00:01:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:38,283 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 508 transitions. [2024-11-10 00:01:38,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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-10 00:01:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 508 transitions. [2024-11-10 00:01:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:01:38,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:38,284 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] [2024-11-10 00:01:38,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:01:38,285 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:38,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:38,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1705257546, now seen corresponding path program 1 times [2024-11-10 00:01:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:38,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422014668] [2024-11-10 00:01:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:38,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:38,636 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-10 00:01:38,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:38,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422014668] [2024-11-10 00:01:38,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422014668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:38,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:38,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:38,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444903810] [2024-11-10 00:01:38,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:38,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:38,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:38,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:38,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:38,639 INFO L87 Difference]: Start difference. First operand 396 states and 508 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:39,266 INFO L93 Difference]: Finished difference Result 659 states and 850 transitions. [2024-11-10 00:01:39,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:01:39,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-10 00:01:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:39,269 INFO L225 Difference]: With dead ends: 659 [2024-11-10 00:01:39,269 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:01:39,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:01:39,270 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 2057 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2057 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:39,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2057 Valid, 1193 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:01:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:01:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 396. [2024-11-10 00:01:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3342105263157895) internal successors, (507), 395 states have internal predecessors, (507), 0 states have call successors, (0), 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-10 00:01:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2024-11-10 00:01:39,279 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 78 [2024-11-10 00:01:39,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:39,280 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2024-11-10 00:01:39,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2024-11-10 00:01:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:01:39,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:39,281 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] [2024-11-10 00:01:39,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:01:39,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:39,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:39,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2113581853, now seen corresponding path program 1 times [2024-11-10 00:01:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:39,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017709918] [2024-11-10 00:01:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:39,663 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-10 00:01:39,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:39,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017709918] [2024-11-10 00:01:39,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017709918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:39,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:39,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:39,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244436252] [2024-11-10 00:01:39,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:39,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:39,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:39,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:39,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:39,666 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:40,365 INFO L93 Difference]: Finished difference Result 685 states and 889 transitions. [2024-11-10 00:01:40,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:01:40,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-10 00:01:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:40,368 INFO L225 Difference]: With dead ends: 685 [2024-11-10 00:01:40,368 INFO L226 Difference]: Without dead ends: 604 [2024-11-10 00:01:40,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:01:40,370 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1799 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1799 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:40,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1799 Valid, 1473 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-10 00:01:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 396. [2024-11-10 00:01:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.331578947368421) internal successors, (506), 395 states have internal predecessors, (506), 0 states have call successors, (0), 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-10 00:01:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 506 transitions. [2024-11-10 00:01:40,380 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 506 transitions. Word has length 78 [2024-11-10 00:01:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:40,381 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 506 transitions. [2024-11-10 00:01:40,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 506 transitions. [2024-11-10 00:01:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:01:40,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:40,382 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] [2024-11-10 00:01:40,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:01:40,383 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:40,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:40,383 INFO L85 PathProgramCache]: Analyzing trace with hash 620496526, now seen corresponding path program 1 times [2024-11-10 00:01:40,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:40,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169899485] [2024-11-10 00:01:40,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:40,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:40,752 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-10 00:01:40,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169899485] [2024-11-10 00:01:40,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169899485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:40,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:40,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:40,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857632875] [2024-11-10 00:01:40,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:40,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:40,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:40,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:40,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:40,754 INFO L87 Difference]: Start difference. First operand 396 states and 506 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:41,426 INFO L93 Difference]: Finished difference Result 690 states and 892 transitions. [2024-11-10 00:01:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:01:41,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-10 00:01:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:41,429 INFO L225 Difference]: With dead ends: 690 [2024-11-10 00:01:41,429 INFO L226 Difference]: Without dead ends: 604 [2024-11-10 00:01:41,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:01:41,432 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 2018 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2018 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:41,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2018 Valid, 1320 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:01:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-10 00:01:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 396. [2024-11-10 00:01:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3289473684210527) internal successors, (505), 395 states have internal predecessors, (505), 0 states have call successors, (0), 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-10 00:01:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 505 transitions. [2024-11-10 00:01:41,442 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 505 transitions. Word has length 78 [2024-11-10 00:01:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:41,442 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 505 transitions. [2024-11-10 00:01:41,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 505 transitions. [2024-11-10 00:01:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:01:41,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:41,445 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] [2024-11-10 00:01:41,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:01:41,445 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:41,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:41,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1046377744, now seen corresponding path program 1 times [2024-11-10 00:01:41,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:41,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265906224] [2024-11-10 00:01:41,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:41,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:41,780 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-10 00:01:41,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:41,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265906224] [2024-11-10 00:01:41,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265906224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:41,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:41,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:41,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867935387] [2024-11-10 00:01:41,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:41,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:41,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:41,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:41,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:41,783 INFO L87 Difference]: Start difference. First operand 396 states and 505 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:42,610 INFO L93 Difference]: Finished difference Result 715 states and 930 transitions. [2024-11-10 00:01:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:01:42,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-10 00:01:42,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:42,613 INFO L225 Difference]: With dead ends: 715 [2024-11-10 00:01:42,613 INFO L226 Difference]: Without dead ends: 612 [2024-11-10 00:01:42,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:01:42,616 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 1158 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:42,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1627 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:01:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-10 00:01:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 396. [2024-11-10 00:01:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3263157894736841) internal successors, (504), 395 states have internal predecessors, (504), 0 states have call successors, (0), 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-10 00:01:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 504 transitions. [2024-11-10 00:01:42,627 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 504 transitions. Word has length 78 [2024-11-10 00:01:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:42,627 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 504 transitions. [2024-11-10 00:01:42,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2024-11-10 00:01:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:01:42,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:42,629 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] [2024-11-10 00:01:42,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:01:42,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:42,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash 486433660, now seen corresponding path program 1 times [2024-11-10 00:01:42,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:42,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75901301] [2024-11-10 00:01:42,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:42,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:42,907 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-10 00:01:42,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:42,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75901301] [2024-11-10 00:01:42,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75901301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:42,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:42,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:42,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230423089] [2024-11-10 00:01:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:42,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:42,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:42,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:42,910 INFO L87 Difference]: Start difference. First operand 396 states and 504 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:43,633 INFO L93 Difference]: Finished difference Result 662 states and 848 transitions. [2024-11-10 00:01:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:01:43,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-10 00:01:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:43,637 INFO L225 Difference]: With dead ends: 662 [2024-11-10 00:01:43,637 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:01:43,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:01:43,638 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 2652 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2652 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:43,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2652 Valid, 1277 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:01:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 396. [2024-11-10 00:01:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 395 states have internal predecessors, (503), 0 states have call successors, (0), 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-10 00:01:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 503 transitions. [2024-11-10 00:01:43,649 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 503 transitions. Word has length 78 [2024-11-10 00:01:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:43,649 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 503 transitions. [2024-11-10 00:01:43,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 503 transitions. [2024-11-10 00:01:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:01:43,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:43,651 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] [2024-11-10 00:01:43,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:01:43,652 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:43,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:43,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1250074464, now seen corresponding path program 1 times [2024-11-10 00:01:43,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:43,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339443776] [2024-11-10 00:01:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:44,173 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-10 00:01:44,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:44,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339443776] [2024-11-10 00:01:44,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339443776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:44,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:44,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 00:01:44,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592553513] [2024-11-10 00:01:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:44,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 00:01:44,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:44,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 00:01:44,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:01:44,176 INFO L87 Difference]: Start difference. First operand 396 states and 503 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:45,347 INFO L93 Difference]: Finished difference Result 840 states and 1099 transitions. [2024-11-10 00:01:45,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 00:01:45,348 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-10 00:01:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:45,351 INFO L225 Difference]: With dead ends: 840 [2024-11-10 00:01:45,351 INFO L226 Difference]: Without dead ends: 692 [2024-11-10 00:01:45,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:01:45,353 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 2549 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2549 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:45,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2549 Valid, 2215 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 00:01:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-11-10 00:01:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 396. [2024-11-10 00:01:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 395 states have internal predecessors, (502), 0 states have call successors, (0), 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-10 00:01:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 502 transitions. [2024-11-10 00:01:45,364 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 502 transitions. Word has length 78 [2024-11-10 00:01:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:45,365 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 502 transitions. [2024-11-10 00:01:45,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 502 transitions. [2024-11-10 00:01:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:01:45,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:45,366 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] [2024-11-10 00:01:45,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:01:45,366 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:45,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash -760498389, now seen corresponding path program 1 times [2024-11-10 00:01:45,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:45,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937191392] [2024-11-10 00:01:45,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:45,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:45,662 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-10 00:01:45,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:45,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937191392] [2024-11-10 00:01:45,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937191392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:45,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:45,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:45,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714547826] [2024-11-10 00:01:45,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:45,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:45,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:45,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:45,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:45,665 INFO L87 Difference]: Start difference. First operand 396 states and 502 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:46,423 INFO L93 Difference]: Finished difference Result 715 states and 924 transitions. [2024-11-10 00:01:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:46,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-10 00:01:46,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:46,426 INFO L225 Difference]: With dead ends: 715 [2024-11-10 00:01:46,426 INFO L226 Difference]: Without dead ends: 612 [2024-11-10 00:01:46,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-10 00:01:46,427 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 1134 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:46,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1724 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:46,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-10 00:01:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 396. [2024-11-10 00:01:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.318421052631579) internal successors, (501), 395 states have internal predecessors, (501), 0 states have call successors, (0), 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-10 00:01:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 501 transitions. [2024-11-10 00:01:46,437 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 501 transitions. Word has length 78 [2024-11-10 00:01:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:46,437 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 501 transitions. [2024-11-10 00:01:46,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 501 transitions. [2024-11-10 00:01:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:01:46,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:46,439 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] [2024-11-10 00:01:46,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:01:46,440 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:46,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:46,440 INFO L85 PathProgramCache]: Analyzing trace with hash -894561255, now seen corresponding path program 1 times [2024-11-10 00:01:46,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:46,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57116473] [2024-11-10 00:01:46,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:46,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:46,724 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-10 00:01:46,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:46,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57116473] [2024-11-10 00:01:46,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57116473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:46,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:46,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923627706] [2024-11-10 00:01:46,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:46,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:46,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:46,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:46,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:46,727 INFO L87 Difference]: Start difference. First operand 396 states and 501 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:47,446 INFO L93 Difference]: Finished difference Result 685 states and 881 transitions. [2024-11-10 00:01:47,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:47,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-10 00:01:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:47,449 INFO L225 Difference]: With dead ends: 685 [2024-11-10 00:01:47,449 INFO L226 Difference]: Without dead ends: 604 [2024-11-10 00:01:47,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-10 00:01:47,450 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 2147 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:47,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 1529 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-10 00:01:47,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 396. [2024-11-10 00:01:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3157894736842106) internal successors, (500), 395 states have internal predecessors, (500), 0 states have call successors, (0), 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-10 00:01:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2024-11-10 00:01:47,460 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 78 [2024-11-10 00:01:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:47,460 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2024-11-10 00:01:47,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-10 00:01:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2024-11-10 00:01:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:47,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:47,462 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] [2024-11-10 00:01:47,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:01:47,463 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:47,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:47,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1994492726, now seen corresponding path program 1 times [2024-11-10 00:01:47,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:47,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623810280] [2024-11-10 00:01:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:47,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:47,916 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-10 00:01:47,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:47,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623810280] [2024-11-10 00:01:47,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623810280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:47,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:47,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:47,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751922159] [2024-11-10 00:01:47,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:47,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:47,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:47,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:47,918 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:48,649 INFO L93 Difference]: Finished difference Result 681 states and 876 transitions. [2024-11-10 00:01:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:01:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:48,652 INFO L225 Difference]: With dead ends: 681 [2024-11-10 00:01:48,652 INFO L226 Difference]: Without dead ends: 604 [2024-11-10 00:01:48,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:01:48,654 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 2479 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2479 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:48,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2479 Valid, 1523 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-10 00:01:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 396. [2024-11-10 00:01:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.313157894736842) internal successors, (499), 395 states have internal predecessors, (499), 0 states have call successors, (0), 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-10 00:01:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 499 transitions. [2024-11-10 00:01:48,662 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 499 transitions. Word has length 80 [2024-11-10 00:01:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:48,662 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 499 transitions. [2024-11-10 00:01:48,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 499 transitions. [2024-11-10 00:01:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:48,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:48,664 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] [2024-11-10 00:01:48,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:01:48,664 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:48,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash -222105992, now seen corresponding path program 1 times [2024-11-10 00:01:48,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:48,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343257861] [2024-11-10 00:01:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:48,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:48,986 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-10 00:01:48,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:48,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343257861] [2024-11-10 00:01:48,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343257861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:48,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:48,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:48,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731202267] [2024-11-10 00:01:48,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:48,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:48,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:48,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:48,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:48,989 INFO L87 Difference]: Start difference. First operand 396 states and 499 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:49,734 INFO L93 Difference]: Finished difference Result 657 states and 837 transitions. [2024-11-10 00:01:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:49,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:01:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:49,737 INFO L225 Difference]: With dead ends: 657 [2024-11-10 00:01:49,737 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:01:49,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-10 00:01:49,741 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 1750 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:49,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 1697 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:01:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 396. [2024-11-10 00:01:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3105263157894738) internal successors, (498), 395 states have internal predecessors, (498), 0 states have call successors, (0), 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-10 00:01:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 498 transitions. [2024-11-10 00:01:49,751 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 498 transitions. Word has length 80 [2024-11-10 00:01:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:49,751 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 498 transitions. [2024-11-10 00:01:49,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 498 transitions. [2024-11-10 00:01:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:49,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:49,753 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] [2024-11-10 00:01:49,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:01:49,754 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:49,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:49,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1986887002, now seen corresponding path program 1 times [2024-11-10 00:01:49,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:49,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167333427] [2024-11-10 00:01:49,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:49,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:50,089 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-10 00:01:50,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:50,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167333427] [2024-11-10 00:01:50,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167333427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:50,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:50,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:50,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119820381] [2024-11-10 00:01:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:50,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:50,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:50,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:50,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:50,091 INFO L87 Difference]: Start difference. First operand 396 states and 498 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:50,833 INFO L93 Difference]: Finished difference Result 659 states and 838 transitions. [2024-11-10 00:01:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:50,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:01:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:50,836 INFO L225 Difference]: With dead ends: 659 [2024-11-10 00:01:50,836 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:01:50,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-10 00:01:50,837 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 1746 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:50,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 1701 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:01:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 396. [2024-11-10 00:01:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3078947368421052) internal successors, (497), 395 states have internal predecessors, (497), 0 states have call successors, (0), 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-10 00:01:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 497 transitions. [2024-11-10 00:01:50,846 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 497 transitions. Word has length 80 [2024-11-10 00:01:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:50,846 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 497 transitions. [2024-11-10 00:01:50,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 497 transitions. [2024-11-10 00:01:50,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:50,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:50,848 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] [2024-11-10 00:01:50,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:01:50,848 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:50,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash -916558147, now seen corresponding path program 1 times [2024-11-10 00:01:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:50,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713491264] [2024-11-10 00:01:50,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:50,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:51,227 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-10 00:01:51,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:51,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713491264] [2024-11-10 00:01:51,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713491264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:51,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:51,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:51,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978278414] [2024-11-10 00:01:51,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:51,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:51,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:51,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:51,229 INFO L87 Difference]: Start difference. First operand 396 states and 497 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:51,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:51,843 INFO L93 Difference]: Finished difference Result 593 states and 739 transitions. [2024-11-10 00:01:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:01:51,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:01:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:51,847 INFO L225 Difference]: With dead ends: 593 [2024-11-10 00:01:51,847 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:01:51,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:01:51,848 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1742 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:51,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 1533 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:01:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:01:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 396. [2024-11-10 00:01:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.305263157894737) internal successors, (496), 395 states have internal predecessors, (496), 0 states have call successors, (0), 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-10 00:01:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 496 transitions. [2024-11-10 00:01:51,857 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 496 transitions. Word has length 80 [2024-11-10 00:01:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:51,858 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 496 transitions. [2024-11-10 00:01:51,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 496 transitions. [2024-11-10 00:01:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:51,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:51,859 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] [2024-11-10 00:01:51,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:01:51,859 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:51,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash 258990940, now seen corresponding path program 1 times [2024-11-10 00:01:51,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:51,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082716097] [2024-11-10 00:01:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:52,157 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-10 00:01:52,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:52,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082716097] [2024-11-10 00:01:52,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082716097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:52,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:52,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320396572] [2024-11-10 00:01:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:52,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:52,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:52,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:52,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:52,161 INFO L87 Difference]: Start difference. First operand 396 states and 496 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:52,887 INFO L93 Difference]: Finished difference Result 685 states and 874 transitions. [2024-11-10 00:01:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:52,888 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:01:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:52,890 INFO L225 Difference]: With dead ends: 685 [2024-11-10 00:01:52,891 INFO L226 Difference]: Without dead ends: 604 [2024-11-10 00:01:52,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:01:52,892 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 2462 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:52,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 1523 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-10 00:01:52,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 396. [2024-11-10 00:01:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3026315789473684) internal successors, (495), 395 states have internal predecessors, (495), 0 states have call successors, (0), 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-10 00:01:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 495 transitions. [2024-11-10 00:01:52,905 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 495 transitions. Word has length 80 [2024-11-10 00:01:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:52,906 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 495 transitions. [2024-11-10 00:01:52,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 495 transitions. [2024-11-10 00:01:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:52,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:52,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] [2024-11-10 00:01:52,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:01:52,908 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:52,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1665679788, now seen corresponding path program 1 times [2024-11-10 00:01:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:52,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932253229] [2024-11-10 00:01:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:52,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:53,231 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-10 00:01:53,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:53,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932253229] [2024-11-10 00:01:53,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932253229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:53,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:53,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:53,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879482958] [2024-11-10 00:01:53,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:53,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:53,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:53,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:53,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:53,234 INFO L87 Difference]: Start difference. First operand 396 states and 495 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:53,856 INFO L93 Difference]: Finished difference Result 659 states and 834 transitions. [2024-11-10 00:01:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:53,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:01:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:53,858 INFO L225 Difference]: With dead ends: 659 [2024-11-10 00:01:53,858 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:01:53,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-10 00:01:53,859 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 2191 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:53,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 1727 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:01:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:01:53,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 396. [2024-11-10 00:01:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 0 states have call successors, (0), 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-10 00:01:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 494 transitions. [2024-11-10 00:01:53,867 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 494 transitions. Word has length 80 [2024-11-10 00:01:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:53,867 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 494 transitions. [2024-11-10 00:01:53,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 494 transitions. [2024-11-10 00:01:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:53,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:53,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] [2024-11-10 00:01:53,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:01:53,869 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:53,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash 784827440, now seen corresponding path program 1 times [2024-11-10 00:01:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692267755] [2024-11-10 00:01:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:54,184 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-10 00:01:54,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:54,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692267755] [2024-11-10 00:01:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692267755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:54,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:54,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:54,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855463086] [2024-11-10 00:01:54,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:54,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:54,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:54,186 INFO L87 Difference]: Start difference. First operand 396 states and 494 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:54,943 INFO L93 Difference]: Finished difference Result 662 states and 836 transitions. [2024-11-10 00:01:54,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:54,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:01:54,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:54,946 INFO L225 Difference]: With dead ends: 662 [2024-11-10 00:01:54,946 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:01:54,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-10 00:01:54,947 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 2186 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2186 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:54,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2186 Valid, 1731 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:01:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 396. [2024-11-10 00:01:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.2973684210526315) internal successors, (493), 395 states have internal predecessors, (493), 0 states have call successors, (0), 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-10 00:01:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 493 transitions. [2024-11-10 00:01:54,959 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 493 transitions. Word has length 80 [2024-11-10 00:01:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:54,959 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 493 transitions. [2024-11-10 00:01:54,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 493 transitions. [2024-11-10 00:01:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:54,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:54,961 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] [2024-11-10 00:01:54,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:01:54,961 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:54,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1229103559, now seen corresponding path program 1 times [2024-11-10 00:01:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:54,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331466506] [2024-11-10 00:01:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:55,505 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-10 00:01:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:55,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331466506] [2024-11-10 00:01:55,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331466506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:55,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:55,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 00:01:55,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183082779] [2024-11-10 00:01:55,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:55,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:01:55,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:55,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:01:55,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:01:55,509 INFO L87 Difference]: Start difference. First operand 396 states and 493 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:56,508 INFO L93 Difference]: Finished difference Result 769 states and 984 transitions. [2024-11-10 00:01:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 00:01:56,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:01:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:56,511 INFO L225 Difference]: With dead ends: 769 [2024-11-10 00:01:56,512 INFO L226 Difference]: Without dead ends: 764 [2024-11-10 00:01:56,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:01:56,513 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 4948 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4948 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:56,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4948 Valid, 1488 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:01:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-11-10 00:01:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 400. [2024-11-10 00:01:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 384 states have (on average 1.2942708333333333) internal successors, (497), 399 states have internal predecessors, (497), 0 states have call successors, (0), 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-10 00:01:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 497 transitions. [2024-11-10 00:01:56,522 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 497 transitions. Word has length 80 [2024-11-10 00:01:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:56,522 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 497 transitions. [2024-11-10 00:01:56,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:56,523 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 497 transitions. [2024-11-10 00:01:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:56,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:56,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:56,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 00:01:56,524 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:56,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:56,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1674615658, now seen corresponding path program 1 times [2024-11-10 00:01:56,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:56,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930365326] [2024-11-10 00:01:56,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:56,851 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-10 00:01:56,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:56,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930365326] [2024-11-10 00:01:56,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930365326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:56,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:56,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:56,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730744471] [2024-11-10 00:01:56,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:56,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:56,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:56,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:56,854 INFO L87 Difference]: Start difference. First operand 400 states and 497 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:57,586 INFO L93 Difference]: Finished difference Result 659 states and 831 transitions. [2024-11-10 00:01:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:57,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:01:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:57,589 INFO L225 Difference]: With dead ends: 659 [2024-11-10 00:01:57,590 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:01:57,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-10 00:01:57,592 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 2183 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2183 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:57,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2183 Valid, 1735 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:01:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 400. [2024-11-10 00:01:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 384 states have (on average 1.2916666666666667) internal successors, (496), 399 states have internal predecessors, (496), 0 states have call successors, (0), 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-10 00:01:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 496 transitions. [2024-11-10 00:01:57,607 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 496 transitions. Word has length 80 [2024-11-10 00:01:57,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:57,607 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 496 transitions. [2024-11-10 00:01:57,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:57,607 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 496 transitions. [2024-11-10 00:01:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:57,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:57,608 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] [2024-11-10 00:01:57,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 00:01:57,608 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:57,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:57,609 INFO L85 PathProgramCache]: Analyzing trace with hash 367691467, now seen corresponding path program 1 times [2024-11-10 00:01:57,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:57,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681403720] [2024-11-10 00:01:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:57,846 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-10 00:01:57,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:57,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681403720] [2024-11-10 00:01:57,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681403720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:57,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:57,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099046957] [2024-11-10 00:01:57,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:57,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:57,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:57,848 INFO L87 Difference]: Start difference. First operand 400 states and 496 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:58,478 INFO L93 Difference]: Finished difference Result 625 states and 777 transitions. [2024-11-10 00:01:58,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:01:58,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:01:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:58,481 INFO L225 Difference]: With dead ends: 625 [2024-11-10 00:01:58,481 INFO L226 Difference]: Without dead ends: 608 [2024-11-10 00:01:58,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:01:58,482 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 1181 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:58,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1508 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:01:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-10 00:01:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 400. [2024-11-10 00:01:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 384 states have (on average 1.2890625) internal successors, (495), 399 states have internal predecessors, (495), 0 states have call successors, (0), 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-10 00:01:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 495 transitions. [2024-11-10 00:01:58,489 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 495 transitions. Word has length 80 [2024-11-10 00:01:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:58,489 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 495 transitions. [2024-11-10 00:01:58,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 495 transitions. [2024-11-10 00:01:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:58,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:58,490 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] [2024-11-10 00:01:58,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 00:01:58,490 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:58,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:58,491 INFO L85 PathProgramCache]: Analyzing trace with hash 793572685, now seen corresponding path program 1 times [2024-11-10 00:01:58,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:58,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932187276] [2024-11-10 00:01:58,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:58,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:58,776 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-10 00:01:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:58,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932187276] [2024-11-10 00:01:58,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932187276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:58,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:58,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:58,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179002370] [2024-11-10 00:01:58,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:58,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:58,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:58,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:58,779 INFO L87 Difference]: Start difference. First operand 400 states and 495 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:59,456 INFO L93 Difference]: Finished difference Result 593 states and 731 transitions. [2024-11-10 00:01:59,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:01:59,456 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:01:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:59,458 INFO L225 Difference]: With dead ends: 593 [2024-11-10 00:01:59,458 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:01:59,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-10 00:01:59,459 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 2154 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:59,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 1783 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:01:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 400. [2024-11-10 00:01:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 384 states have (on average 1.2864583333333333) internal successors, (494), 399 states have internal predecessors, (494), 0 states have call successors, (0), 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-10 00:01:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 494 transitions. [2024-11-10 00:01:59,465 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 494 transitions. Word has length 80 [2024-11-10 00:01:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:59,465 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 494 transitions. [2024-11-10 00:01:59,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:01:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 494 transitions. [2024-11-10 00:01:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:01:59,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:59,467 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] [2024-11-10 00:01:59,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 00:01:59,467 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:01:59,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 452318272, now seen corresponding path program 1 times [2024-11-10 00:01:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:59,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656160549] [2024-11-10 00:01:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:59,685 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-10 00:01:59,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:59,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656160549] [2024-11-10 00:01:59,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656160549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:59,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:59,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:01:59,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931734365] [2024-11-10 00:01:59,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:59,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:01:59,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:59,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:01:59,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:01:59,688 INFO L87 Difference]: Start difference. First operand 400 states and 494 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:00,364 INFO L93 Difference]: Finished difference Result 725 states and 920 transitions. [2024-11-10 00:02:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:02:00,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:02:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:00,367 INFO L225 Difference]: With dead ends: 725 [2024-11-10 00:02:00,367 INFO L226 Difference]: Without dead ends: 616 [2024-11-10 00:02:00,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:02:00,368 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 1528 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:00,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 1871 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:02:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-10 00:02:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 400. [2024-11-10 00:02:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 384 states have (on average 1.2838541666666667) internal successors, (493), 399 states have internal predecessors, (493), 0 states have call successors, (0), 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-10 00:02:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 493 transitions. [2024-11-10 00:02:00,376 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 493 transitions. Word has length 80 [2024-11-10 00:02:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:00,376 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 493 transitions. [2024-11-10 00:02:00,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 493 transitions. [2024-11-10 00:02:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:02:00,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:00,378 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] [2024-11-10 00:02:00,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 00:02:00,378 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:00,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1952842114, now seen corresponding path program 1 times [2024-11-10 00:02:00,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:00,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272296714] [2024-11-10 00:02:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:00,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:00,638 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-10 00:02:00,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272296714] [2024-11-10 00:02:00,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272296714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:00,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:00,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:00,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361929256] [2024-11-10 00:02:00,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:00,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:02:00,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:00,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:02:00,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:02:00,641 INFO L87 Difference]: Start difference. First operand 400 states and 493 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:01,348 INFO L93 Difference]: Finished difference Result 694 states and 873 transitions. [2024-11-10 00:02:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:02:01,348 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:02:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:01,350 INFO L225 Difference]: With dead ends: 694 [2024-11-10 00:02:01,350 INFO L226 Difference]: Without dead ends: 608 [2024-11-10 00:02:01,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:02:01,351 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 2290 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2290 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:01,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2290 Valid, 1647 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:02:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-10 00:02:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 400. [2024-11-10 00:02:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 384 states have (on average 1.28125) internal successors, (492), 399 states have internal predecessors, (492), 0 states have call successors, (0), 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-10 00:02:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 492 transitions. [2024-11-10 00:02:01,363 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 492 transitions. Word has length 80 [2024-11-10 00:02:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:01,363 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 492 transitions. [2024-11-10 00:02:01,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 492 transitions. [2024-11-10 00:02:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:02:01,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:01,366 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] [2024-11-10 00:02:01,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 00:02:01,366 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:01,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:01,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1916243964, now seen corresponding path program 1 times [2024-11-10 00:02:01,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:01,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704428216] [2024-11-10 00:02:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:01,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:01,626 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-10 00:02:01,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:01,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704428216] [2024-11-10 00:02:01,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704428216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:01,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:01,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:01,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017775896] [2024-11-10 00:02:01,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:01,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:02:01,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:01,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:02:01,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:02:01,628 INFO L87 Difference]: Start difference. First operand 400 states and 492 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:02,306 INFO L93 Difference]: Finished difference Result 662 states and 829 transitions. [2024-11-10 00:02:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:02:02,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:02:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:02,308 INFO L225 Difference]: With dead ends: 662 [2024-11-10 00:02:02,308 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:02:02,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-10 00:02:02,309 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 1576 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:02,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 1866 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:02:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:02:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 400. [2024-11-10 00:02:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 384 states have (on average 1.2786458333333333) internal successors, (491), 399 states have internal predecessors, (491), 0 states have call successors, (0), 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-10 00:02:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 491 transitions. [2024-11-10 00:02:02,318 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 491 transitions. Word has length 80 [2024-11-10 00:02:02,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:02,318 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 491 transitions. [2024-11-10 00:02:02,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 491 transitions. [2024-11-10 00:02:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:02:02,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:02,319 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] [2024-11-10 00:02:02,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 00:02:02,320 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:02,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash 455646409, now seen corresponding path program 1 times [2024-11-10 00:02:02,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:02,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940663084] [2024-11-10 00:02:02,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:02,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:02,582 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-10 00:02:02,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:02,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940663084] [2024-11-10 00:02:02,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940663084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:02,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:02,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620445683] [2024-11-10 00:02:02,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:02,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:02:02,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:02,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:02:02,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:02:02,586 INFO L87 Difference]: Start difference. First operand 400 states and 491 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:03,233 INFO L93 Difference]: Finished difference Result 593 states and 727 transitions. [2024-11-10 00:02:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:02:03,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:02:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:03,236 INFO L225 Difference]: With dead ends: 593 [2024-11-10 00:02:03,236 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:02:03,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:02:03,237 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 1092 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:03,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1691 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:02:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:02:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 396. [2024-11-10 00:02:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.2789473684210526) internal successors, (486), 395 states have internal predecessors, (486), 0 states have call successors, (0), 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-10 00:02:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 486 transitions. [2024-11-10 00:02:03,246 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 486 transitions. Word has length 81 [2024-11-10 00:02:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:03,247 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 486 transitions. [2024-11-10 00:02:03,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 486 transitions. [2024-11-10 00:02:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:02:03,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:03,248 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] [2024-11-10 00:02:03,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 00:02:03,249 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:03,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:03,249 INFO L85 PathProgramCache]: Analyzing trace with hash -353940682, now seen corresponding path program 1 times [2024-11-10 00:02:03,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:03,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178456505] [2024-11-10 00:02:03,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:03,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:03,886 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-10 00:02:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:03,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178456505] [2024-11-10 00:02:03,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178456505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:03,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:03,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 00:02:03,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300364768] [2024-11-10 00:02:03,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:03,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:02:03,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:03,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:02:03,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:02:03,889 INFO L87 Difference]: Start difference. First operand 396 states and 486 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:04,472 INFO L93 Difference]: Finished difference Result 679 states and 860 transitions. [2024-11-10 00:02:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:02:04,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 00:02:04,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:04,474 INFO L225 Difference]: With dead ends: 679 [2024-11-10 00:02:04,474 INFO L226 Difference]: Without dead ends: 591 [2024-11-10 00:02:04,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:02:04,475 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 2417 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2417 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:04,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2417 Valid, 3266 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:02:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-10 00:02:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 377. [2024-11-10 00:02:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 361 states have (on average 1.2742382271468145) internal successors, (460), 376 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 460 transitions. [2024-11-10 00:02:04,483 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 460 transitions. Word has length 82 [2024-11-10 00:02:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:04,484 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 460 transitions. [2024-11-10 00:02:04,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 460 transitions. [2024-11-10 00:02:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:02:04,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:04,485 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] [2024-11-10 00:02:04,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 00:02:04,486 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:04,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1828776294, now seen corresponding path program 1 times [2024-11-10 00:02:04,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:04,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942227487] [2024-11-10 00:02:04,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:04,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:06,332 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-10 00:02:06,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:06,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942227487] [2024-11-10 00:02:06,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942227487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:06,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:06,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-10 00:02:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013528240] [2024-11-10 00:02:06,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:06,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 00:02:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:06,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 00:02:06,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:02:06,335 INFO L87 Difference]: Start difference. First operand 377 states and 460 transitions. Second operand has 28 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:12,465 INFO L93 Difference]: Finished difference Result 1421 states and 1773 transitions. [2024-11-10 00:02:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-10 00:02:12,466 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 00:02:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:12,469 INFO L225 Difference]: With dead ends: 1421 [2024-11-10 00:02:12,469 INFO L226 Difference]: Without dead ends: 1349 [2024-11-10 00:02:12,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=544, Invalid=2318, Unknown=0, NotChecked=0, Total=2862 [2024-11-10 00:02:12,470 INFO L432 NwaCegarLoop]: 1164 mSDtfsCounter, 4522 mSDsluCounter, 15688 mSDsCounter, 0 mSdLazyCounter, 7953 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 16852 SdHoareTripleChecker+Invalid, 7971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 7953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:12,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 16852 Invalid, 7971 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 7953 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-10 00:02:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2024-11-10 00:02:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 387. [2024-11-10 00:02:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 371 states have (on average 1.2722371967654986) internal successors, (472), 386 states have internal predecessors, (472), 0 states have call successors, (0), 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-10 00:02:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 472 transitions. [2024-11-10 00:02:12,479 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 472 transitions. Word has length 82 [2024-11-10 00:02:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:12,480 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 472 transitions. [2024-11-10 00:02:12,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 472 transitions. [2024-11-10 00:02:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:02:12,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:12,481 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] [2024-11-10 00:02:12,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 00:02:12,482 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:12,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash 603568285, now seen corresponding path program 1 times [2024-11-10 00:02:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951794605] [2024-11-10 00:02:12,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:12,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:13,390 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-10 00:02:13,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:13,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951794605] [2024-11-10 00:02:13,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951794605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:13,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:13,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 00:02:13,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369583515] [2024-11-10 00:02:13,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:13,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 00:02:13,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:13,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 00:02:13,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:02:13,394 INFO L87 Difference]: Start difference. First operand 387 states and 472 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:14,544 INFO L93 Difference]: Finished difference Result 755 states and 945 transitions. [2024-11-10 00:02:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 00:02:14,545 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 00:02:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:14,547 INFO L225 Difference]: With dead ends: 755 [2024-11-10 00:02:14,547 INFO L226 Difference]: Without dead ends: 660 [2024-11-10 00:02:14,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2024-11-10 00:02:14,549 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 3090 mSDsluCounter, 5036 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3090 SdHoareTripleChecker+Valid, 5784 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:14,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3090 Valid, 5784 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:02:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-10 00:02:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 377. [2024-11-10 00:02:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 361 states have (on average 1.2714681440443214) internal successors, (459), 376 states have internal predecessors, (459), 0 states have call successors, (0), 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-10 00:02:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 459 transitions. [2024-11-10 00:02:14,555 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 459 transitions. Word has length 82 [2024-11-10 00:02:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:14,555 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 459 transitions. [2024-11-10 00:02:14,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 459 transitions. [2024-11-10 00:02:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:02:14,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:14,557 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] [2024-11-10 00:02:14,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 00:02:14,557 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:14,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:14,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1080919292, now seen corresponding path program 1 times [2024-11-10 00:02:14,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:14,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390550904] [2024-11-10 00:02:14,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:14,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:15,075 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-10 00:02:15,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390550904] [2024-11-10 00:02:15,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390550904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:15,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:15,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 00:02:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471317791] [2024-11-10 00:02:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:15,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:02:15,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:15,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:02:15,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:02:15,078 INFO L87 Difference]: Start difference. First operand 377 states and 459 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:15,673 INFO L93 Difference]: Finished difference Result 636 states and 803 transitions. [2024-11-10 00:02:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:02:15,674 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 00:02:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:15,675 INFO L225 Difference]: With dead ends: 636 [2024-11-10 00:02:15,675 INFO L226 Difference]: Without dead ends: 543 [2024-11-10 00:02:15,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-10 00:02:15,676 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 2074 mSDsluCounter, 3216 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2074 SdHoareTripleChecker+Valid, 3804 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:15,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2074 Valid, 3804 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:02:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-10 00:02:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 353. [2024-11-10 00:02:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 338 states have (on average 1.2662721893491125) internal successors, (428), 352 states have internal predecessors, (428), 0 states have call successors, (0), 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-10 00:02:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 428 transitions. [2024-11-10 00:02:15,683 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 428 transitions. Word has length 82 [2024-11-10 00:02:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:15,683 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 428 transitions. [2024-11-10 00:02:15,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 428 transitions. [2024-11-10 00:02:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:02:15,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:15,684 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] [2024-11-10 00:02:15,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 00:02:15,684 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:15,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:15,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1667035218, now seen corresponding path program 1 times [2024-11-10 00:02:15,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:15,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826587680] [2024-11-10 00:02:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:15,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:16,207 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-10 00:02:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826587680] [2024-11-10 00:02:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826587680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:16,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:16,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 00:02:16,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039695003] [2024-11-10 00:02:16,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:16,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:02:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:16,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:02:16,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:02:16,210 INFO L87 Difference]: Start difference. First operand 353 states and 428 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:17,045 INFO L93 Difference]: Finished difference Result 586 states and 732 transitions. [2024-11-10 00:02:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:02:17,046 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 00:02:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:17,047 INFO L225 Difference]: With dead ends: 586 [2024-11-10 00:02:17,048 INFO L226 Difference]: Without dead ends: 513 [2024-11-10 00:02:17,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-10 00:02:17,049 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1909 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1909 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:17,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1909 Valid, 2139 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:02:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-10 00:02:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 349. [2024-11-10 00:02:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 335 states have (on average 1.2626865671641792) internal successors, (423), 348 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 423 transitions. [2024-11-10 00:02:17,055 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 423 transitions. Word has length 82 [2024-11-10 00:02:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:17,056 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 423 transitions. [2024-11-10 00:02:17,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 423 transitions. [2024-11-10 00:02:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:02:17,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:17,057 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] [2024-11-10 00:02:17,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 00:02:17,057 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:17,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash -747396784, now seen corresponding path program 1 times [2024-11-10 00:02:17,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:17,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611183190] [2024-11-10 00:02:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:17,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:17,544 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-10 00:02:17,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611183190] [2024-11-10 00:02:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611183190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:17,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:17,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 00:02:17,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320352433] [2024-11-10 00:02:17,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:17,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 00:02:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:17,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 00:02:17,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:02:17,546 INFO L87 Difference]: Start difference. First operand 349 states and 423 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:18,126 INFO L93 Difference]: Finished difference Result 878 states and 1094 transitions. [2024-11-10 00:02:18,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:02:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 00:02:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:18,128 INFO L225 Difference]: With dead ends: 878 [2024-11-10 00:02:18,128 INFO L226 Difference]: Without dead ends: 738 [2024-11-10 00:02:18,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-10 00:02:18,130 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 1788 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1788 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:18,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1788 Valid, 2476 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:02:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-10 00:02:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 278. [2024-11-10 00:02:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 267 states have (on average 1.2659176029962547) internal successors, (338), 277 states have internal predecessors, (338), 0 states have call successors, (0), 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-10 00:02:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 338 transitions. [2024-11-10 00:02:18,137 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 338 transitions. Word has length 82 [2024-11-10 00:02:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:18,137 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 338 transitions. [2024-11-10 00:02:18,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 338 transitions. [2024-11-10 00:02:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:02:18,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:18,138 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] [2024-11-10 00:02:18,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 00:02:18,138 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:18,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:18,139 INFO L85 PathProgramCache]: Analyzing trace with hash 895129241, now seen corresponding path program 1 times [2024-11-10 00:02:18,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:18,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515826143] [2024-11-10 00:02:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:18,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:18,636 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-10 00:02:18,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:18,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515826143] [2024-11-10 00:02:18,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515826143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:18,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:18,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 00:02:18,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822267991] [2024-11-10 00:02:18,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:18,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:02:18,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:18,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:02:18,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:02:18,638 INFO L87 Difference]: Start difference. First operand 278 states and 338 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:19,103 INFO L93 Difference]: Finished difference Result 496 states and 633 transitions. [2024-11-10 00:02:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:02:19,104 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 00:02:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:19,105 INFO L225 Difference]: With dead ends: 496 [2024-11-10 00:02:19,105 INFO L226 Difference]: Without dead ends: 403 [2024-11-10 00:02:19,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:02:19,106 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 1636 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:19,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1636 Valid, 2421 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:02:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-10 00:02:19,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 254. [2024-11-10 00:02:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 244 states have (on average 1.2622950819672132) internal successors, (308), 253 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 308 transitions. [2024-11-10 00:02:19,112 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 308 transitions. Word has length 82 [2024-11-10 00:02:19,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:19,113 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 308 transitions. [2024-11-10 00:02:19,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 308 transitions. [2024-11-10 00:02:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:02:19,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:19,114 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] [2024-11-10 00:02:19,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 00:02:19,114 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:19,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1852825269, now seen corresponding path program 1 times [2024-11-10 00:02:19,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:19,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198609646] [2024-11-10 00:02:19,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:19,706 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-10 00:02:19,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:19,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198609646] [2024-11-10 00:02:19,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198609646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:19,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:19,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 00:02:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252784158] [2024-11-10 00:02:19,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:19,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 00:02:19,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:19,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 00:02:19,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:02:19,709 INFO L87 Difference]: Start difference. First operand 254 states and 308 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:20,425 INFO L93 Difference]: Finished difference Result 776 states and 1001 transitions. [2024-11-10 00:02:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 00:02:20,425 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 00:02:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:20,427 INFO L225 Difference]: With dead ends: 776 [2024-11-10 00:02:20,427 INFO L226 Difference]: Without dead ends: 668 [2024-11-10 00:02:20,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:02:20,428 INFO L432 NwaCegarLoop]: 794 mSDtfsCounter, 1221 mSDsluCounter, 5265 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 6059 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:20,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 6059 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:02:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-10 00:02:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 215. [2024-11-10 00:02:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.2644230769230769) internal successors, (263), 214 states have internal predecessors, (263), 0 states have call successors, (0), 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-10 00:02:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 263 transitions. [2024-11-10 00:02:20,435 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 263 transitions. Word has length 82 [2024-11-10 00:02:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:20,435 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 263 transitions. [2024-11-10 00:02:20,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 263 transitions. [2024-11-10 00:02:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:02:20,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:20,437 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] [2024-11-10 00:02:20,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 00:02:20,437 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:20,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash 801418304, now seen corresponding path program 1 times [2024-11-10 00:02:20,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:20,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894225502] [2024-11-10 00:02:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:22,171 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-10 00:02:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894225502] [2024-11-10 00:02:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894225502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:22,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:22,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-11-10 00:02:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776911518] [2024-11-10 00:02:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:22,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 00:02:22,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 00:02:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-11-10 00:02:22,173 INFO L87 Difference]: Start difference. First operand 215 states and 263 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:25,582 INFO L93 Difference]: Finished difference Result 923 states and 1205 transitions. [2024-11-10 00:02:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-10 00:02:25,583 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 00:02:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:25,586 INFO L225 Difference]: With dead ends: 923 [2024-11-10 00:02:25,586 INFO L226 Difference]: Without dead ends: 850 [2024-11-10 00:02:25,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=434, Invalid=2322, Unknown=0, NotChecked=0, Total=2756 [2024-11-10 00:02:25,587 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 2612 mSDsluCounter, 8154 mSDsCounter, 0 mSdLazyCounter, 4354 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 8783 SdHoareTripleChecker+Invalid, 4373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:25,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 8783 Invalid, 4373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4354 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 00:02:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-10 00:02:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 235. [2024-11-10 00:02:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 228 states have (on average 1.2719298245614035) internal successors, (290), 234 states have internal predecessors, (290), 0 states have call successors, (0), 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-10 00:02:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 290 transitions. [2024-11-10 00:02:25,593 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 290 transitions. Word has length 82 [2024-11-10 00:02:25,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:25,594 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 290 transitions. [2024-11-10 00:02:25,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 290 transitions. [2024-11-10 00:02:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:02:25,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:25,595 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] [2024-11-10 00:02:25,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-10 00:02:25,596 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:25,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:25,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1058550018, now seen corresponding path program 1 times [2024-11-10 00:02:25,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:25,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563033096] [2024-11-10 00:02:25,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:25,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:26,055 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-10 00:02:26,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:26,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563033096] [2024-11-10 00:02:26,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563033096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:26,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:26,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 00:02:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347154230] [2024-11-10 00:02:26,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:26,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:02:26,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:02:26,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:02:26,057 INFO L87 Difference]: Start difference. First operand 235 states and 290 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:26,466 INFO L93 Difference]: Finished difference Result 420 states and 546 transitions. [2024-11-10 00:02:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:02:26,466 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 00:02:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:26,467 INFO L225 Difference]: With dead ends: 420 [2024-11-10 00:02:26,467 INFO L226 Difference]: Without dead ends: 318 [2024-11-10 00:02:26,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-10 00:02:26,468 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1011 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:26,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1875 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:02:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-10 00:02:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 202. [2024-11-10 00:02:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.2626262626262625) internal successors, (250), 201 states have internal predecessors, (250), 0 states have call successors, (0), 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-10 00:02:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2024-11-10 00:02:26,474 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 250 transitions. Word has length 82 [2024-11-10 00:02:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:26,474 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 250 transitions. [2024-11-10 00:02:26,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 00:02:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 250 transitions. [2024-11-10 00:02:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:02:26,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:26,479 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] [2024-11-10 00:02:26,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-10 00:02:26,480 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:26,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:26,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1184783891, now seen corresponding path program 1 times [2024-11-10 00:02:26,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:26,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798288005] [2024-11-10 00:02:26,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:26,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:26,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798288005] [2024-11-10 00:02:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798288005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 00:02:26,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390876132] [2024-11-10 00:02:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:26,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 00:02:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 00:02:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:02:26,979 INFO L87 Difference]: Start difference. First operand 202 states and 250 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:27,573 INFO L93 Difference]: Finished difference Result 541 states and 722 transitions. [2024-11-10 00:02:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 00:02:27,573 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 00:02:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:27,574 INFO L225 Difference]: With dead ends: 541 [2024-11-10 00:02:27,574 INFO L226 Difference]: Without dead ends: 452 [2024-11-10 00:02:27,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:02:27,575 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 855 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:27,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 2237 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:02:27,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-10 00:02:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 166. [2024-11-10 00:02:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 164 states have (on average 1.2439024390243902) internal successors, (204), 165 states have internal predecessors, (204), 0 states have call successors, (0), 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-10 00:02:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 204 transitions. [2024-11-10 00:02:27,579 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 204 transitions. Word has length 83 [2024-11-10 00:02:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:27,580 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 204 transitions. [2024-11-10 00:02:27,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 204 transitions. [2024-11-10 00:02:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:02:27,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:27,581 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] [2024-11-10 00:02:27,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-10 00:02:27,581 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-10 00:02:27,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:27,582 INFO L85 PathProgramCache]: Analyzing trace with hash -997793407, now seen corresponding path program 1 times [2024-11-10 00:02:27,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:27,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249274699] [2024-11-10 00:02:27,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:27,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:27,985 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-10 00:02:27,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:27,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249274699] [2024-11-10 00:02:27,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249274699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:27,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:27,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 00:02:27,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122321573] [2024-11-10 00:02:27,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:27,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:02:27,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:27,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:02:27,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:02:27,988 INFO L87 Difference]: Start difference. First operand 166 states and 204 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)