./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU --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 a6a02224ad3116421a031fb474928d71f99a366daf138bf7c752aaea303a81f9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:59:08,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:59:08,609 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:59:08,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:59:08,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:59:08,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:59:08,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:59:08,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:59:08,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:59:08,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:59:08,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:59:08,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:59:08,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:59:08,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:59:08,656 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:59:08,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:59:08,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:59:08,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:59:08,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:59:08,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:59:08,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:59:08,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:59:08,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:59:08,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:59:08,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:59:08,662 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:59:08,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:59:08,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:59:08,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:59:08,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:59:08,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:59:08,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:59:08,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:08,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:59:08,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:59:08,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:59:08,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:59:08,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:59:08,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:59:08,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:59:08,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:59:08,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:59:08,668 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU 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 -> a6a02224ad3116421a031fb474928d71f99a366daf138bf7c752aaea303a81f9 [2024-10-31 21:59:09,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:59:09,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:59:09,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:59:09,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:59:09,105 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:59:09,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c Unable to find full path for "g++" [2024-10-31 21:59:11,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:59:11,842 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:59:11,845 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-31 21:59:11,862 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/data/b42d0963b/75d6a3fb41e54c05b43fcfe911e46c27/FLAGb0a834c8e [2024-10-31 21:59:12,049 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/data/b42d0963b/75d6a3fb41e54c05b43fcfe911e46c27 [2024-10-31 21:59:12,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:59:12,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:59:12,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:12,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:59:12,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:59:12,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a12a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12, skipping insertion in model container [2024-10-31 21:59:12,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:59:12,429 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7117,7130] [2024-10-31 21:59:12,451 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9784,9797] [2024-10-31 21:59:12,461 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10875,10888] [2024-10-31 21:59:12,467 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11481,11494] [2024-10-31 21:59:12,489 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12900,12913] [2024-10-31 21:59:12,500 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13506,13519] [2024-10-31 21:59:12,514 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14435,14448] [2024-10-31 21:59:12,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:12,599 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:59:12,648 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7117,7130] [2024-10-31 21:59:12,660 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9784,9797] [2024-10-31 21:59:12,671 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10875,10888] [2024-10-31 21:59:12,677 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11481,11494] [2024-10-31 21:59:12,687 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12900,12913] [2024-10-31 21:59:12,691 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13506,13519] [2024-10-31 21:59:12,697 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14435,14448] [2024-10-31 21:59:12,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:12,752 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:59:12,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12 WrapperNode [2024-10-31 21:59:12,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:12,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:12,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:59:12,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:59:12,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,856 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1047 [2024-10-31 21:59:12,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:12,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:59:12,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:59:12,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:59:12,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,901 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-10-31 21:59:12,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:59:12,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:59:12,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:59:12,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:59:12,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (1/1) ... [2024-10-31 21:59:12,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:12,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:13,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:59:13,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23829614-e817-45a7-907e-ca5d0c2d6460/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:59:13,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:59:13,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:59:13,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:59:13,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:59:13,286 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:59:13,289 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:59:14,350 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-10-31 21:59:14,351 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:59:14,378 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:59:14,382 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 21:59:14,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:14 BoogieIcfgContainer [2024-10-31 21:59:14,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:59:14,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:59:14,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:59:14,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:59:14,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:59:12" (1/3) ... [2024-10-31 21:59:14,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291f9d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:14, skipping insertion in model container [2024-10-31 21:59:14,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:12" (2/3) ... [2024-10-31 21:59:14,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291f9d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:14, skipping insertion in model container [2024-10-31 21:59:14,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:14" (3/3) ... [2024-10-31 21:59:14,410 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-31 21:59:14,430 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:59:14,430 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-31 21:59:14,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:59:14,531 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;@5f4de277, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:59:14,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-31 21:59:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 198 states have (on average 1.8232323232323233) internal successors, (361), 205 states have internal predecessors, (361), 0 states have call successors, (0), 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-10-31 21:59:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-31 21:59:14,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:14,548 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] [2024-10-31 21:59:14,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:14,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1899747950, now seen corresponding path program 1 times [2024-10-31 21:59:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57057046] [2024-10-31 21:59:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:14,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57057046] [2024-10-31 21:59:15,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57057046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:15,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:15,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:59:15,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798830125] [2024-10-31 21:59:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:15,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:15,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:15,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:15,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:15,343 INFO L87 Difference]: Start difference. First operand has 206 states, 198 states have (on average 1.8232323232323233) internal successors, (361), 205 states have internal predecessors, (361), 0 states have call successors, (0), 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 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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-10-31 21:59:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:15,632 INFO L93 Difference]: Finished difference Result 338 states and 568 transitions. [2024-10-31 21:59:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:15,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-31 21:59:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:15,650 INFO L225 Difference]: With dead ends: 338 [2024-10-31 21:59:15,650 INFO L226 Difference]: Without dead ends: 174 [2024-10-31 21:59:15,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:15,660 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 846 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:15,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 223 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-31 21:59:15,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-10-31 21:59:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 167 states have (on average 1.2934131736526946) internal successors, (216), 173 states have internal predecessors, (216), 0 states have call successors, (0), 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-10-31 21:59:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2024-10-31 21:59:15,736 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 46 [2024-10-31 21:59:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:15,736 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2024-10-31 21:59:15,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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-10-31 21:59:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2024-10-31 21:59:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-31 21:59:15,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:15,739 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] [2024-10-31 21:59:15,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:59:15,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:15,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:15,741 INFO L85 PathProgramCache]: Analyzing trace with hash -121525429, now seen corresponding path program 1 times [2024-10-31 21:59:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:15,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981714353] [2024-10-31 21:59:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:16,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:16,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981714353] [2024-10-31 21:59:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981714353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:16,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:16,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:59:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959521238] [2024-10-31 21:59:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:16,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:16,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:16,011 INFO L87 Difference]: Start difference. First operand 174 states and 216 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-10-31 21:59:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:16,202 INFO L93 Difference]: Finished difference Result 297 states and 378 transitions. [2024-10-31 21:59:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:16,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-31 21:59:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:16,205 INFO L225 Difference]: With dead ends: 297 [2024-10-31 21:59:16,208 INFO L226 Difference]: Without dead ends: 161 [2024-10-31 21:59:16,208 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-10-31 21:59:16,211 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 558 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:16,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 132 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-31 21:59:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-10-31 21:59:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 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-10-31 21:59:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2024-10-31 21:59:16,229 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 47 [2024-10-31 21:59:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:16,229 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 200 transitions. [2024-10-31 21:59:16,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-10-31 21:59:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2024-10-31 21:59:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-31 21:59:16,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:16,231 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] [2024-10-31 21:59:16,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:59:16,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:16,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash 414043727, now seen corresponding path program 1 times [2024-10-31 21:59:16,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:16,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197806011] [2024-10-31 21:59:16,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197806011] [2024-10-31 21:59:16,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197806011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:16,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:16,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:59:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892730349] [2024-10-31 21:59:16,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:16,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:16,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:16,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:16,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:16,425 INFO L87 Difference]: Start difference. First operand 161 states and 200 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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-10-31 21:59:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:16,600 INFO L93 Difference]: Finished difference Result 284 states and 361 transitions. [2024-10-31 21:59:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:16,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-31 21:59:16,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:16,603 INFO L225 Difference]: With dead ends: 284 [2024-10-31 21:59:16,603 INFO L226 Difference]: Without dead ends: 156 [2024-10-31 21:59:16,606 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-10-31 21:59:16,607 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 524 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:16,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 129 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-31 21:59:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-10-31 21:59:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 155 states have internal predecessors, (193), 0 states have call successors, (0), 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-10-31 21:59:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2024-10-31 21:59:16,624 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 48 [2024-10-31 21:59:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:16,624 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2024-10-31 21:59:16,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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-10-31 21:59:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2024-10-31 21:59:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-31 21:59:16,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:16,626 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] [2024-10-31 21:59:16,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:59:16,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:16,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:16,628 INFO L85 PathProgramCache]: Analyzing trace with hash -453133940, now seen corresponding path program 1 times [2024-10-31 21:59:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:16,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613656002] [2024-10-31 21:59:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:17,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613656002] [2024-10-31 21:59:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613656002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:17,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:17,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:59:17,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264311515] [2024-10-31 21:59:17,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:17,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 21:59:17,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:17,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 21:59:17,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:17,214 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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-10-31 21:59:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:17,795 INFO L93 Difference]: Finished difference Result 243 states and 304 transitions. [2024-10-31 21:59:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 21:59:17,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-31 21:59:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:17,798 INFO L225 Difference]: With dead ends: 243 [2024-10-31 21:59:17,800 INFO L226 Difference]: Without dead ends: 238 [2024-10-31 21:59:17,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-10-31 21:59:17,802 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1092 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:17,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 483 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-31 21:59:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 156. [2024-10-31 21:59:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 155 states have internal predecessors, (192), 0 states have call successors, (0), 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-10-31 21:59:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2024-10-31 21:59:17,813 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 49 [2024-10-31 21:59:17,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:17,814 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2024-10-31 21:59:17,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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-10-31 21:59:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2024-10-31 21:59:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-31 21:59:17,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:17,816 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] [2024-10-31 21:59:17,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:59:17,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:17,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:17,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1459063162, now seen corresponding path program 1 times [2024-10-31 21:59:17,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:17,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255937978] [2024-10-31 21:59:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:17,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:18,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255937978] [2024-10-31 21:59:18,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255937978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:18,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:18,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:59:18,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316390139] [2024-10-31 21:59:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:18,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 21:59:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:18,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 21:59:18,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:18,187 INFO L87 Difference]: Start difference. First operand 156 states and 192 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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-10-31 21:59:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:18,864 INFO L93 Difference]: Finished difference Result 302 states and 388 transitions. [2024-10-31 21:59:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 21:59:18,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-31 21:59:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:18,870 INFO L225 Difference]: With dead ends: 302 [2024-10-31 21:59:18,870 INFO L226 Difference]: Without dead ends: 242 [2024-10-31 21:59:18,870 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-10-31 21:59:18,871 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 882 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:18,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 631 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 21:59:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-31 21:59:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 156. [2024-10-31 21:59:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 155 states have internal predecessors, (191), 0 states have call successors, (0), 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-10-31 21:59:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 191 transitions. [2024-10-31 21:59:18,897 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 191 transitions. Word has length 49 [2024-10-31 21:59:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:18,897 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 191 transitions. [2024-10-31 21:59:18,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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-10-31 21:59:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2024-10-31 21:59:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-31 21:59:18,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:18,900 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] [2024-10-31 21:59:18,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:59:18,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:18,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash 8857914, now seen corresponding path program 1 times [2024-10-31 21:59:18,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:18,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942589415] [2024-10-31 21:59:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:19,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:19,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942589415] [2024-10-31 21:59:19,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942589415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:19,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:19,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:59:19,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869382712] [2024-10-31 21:59:19,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:19,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:59:19,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:19,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:59:19,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:19,236 INFO L87 Difference]: Start difference. First operand 156 states and 191 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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-10-31 21:59:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:19,643 INFO L93 Difference]: Finished difference Result 311 states and 391 transitions. [2024-10-31 21:59:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:59:19,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-31 21:59:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:19,649 INFO L225 Difference]: With dead ends: 311 [2024-10-31 21:59:19,649 INFO L226 Difference]: Without dead ends: 228 [2024-10-31 21:59:19,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-31 21:59:19,650 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 968 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:19,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 393 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-31 21:59:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 156. [2024-10-31 21:59:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 155 states have internal predecessors, (190), 0 states have call successors, (0), 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-10-31 21:59:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2024-10-31 21:59:19,670 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 49 [2024-10-31 21:59:19,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:19,670 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2024-10-31 21:59:19,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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-10-31 21:59:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2024-10-31 21:59:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-31 21:59:19,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:19,676 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] [2024-10-31 21:59:19,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:59:19,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:19,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1308237609, now seen corresponding path program 1 times [2024-10-31 21:59:19,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:19,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730175977] [2024-10-31 21:59:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:21,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:21,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730175977] [2024-10-31 21:59:21,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730175977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:21,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:21,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-31 21:59:21,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752802147] [2024-10-31 21:59:21,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:21,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-31 21:59:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:21,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-31 21:59:21,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-31 21:59:21,159 INFO L87 Difference]: Start difference. First operand 156 states and 190 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-31 21:59:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:23,022 INFO L93 Difference]: Finished difference Result 392 states and 496 transitions. [2024-10-31 21:59:23,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-31 21:59:23,022 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-31 21:59:23,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:23,024 INFO L225 Difference]: With dead ends: 392 [2024-10-31 21:59:23,024 INFO L226 Difference]: Without dead ends: 388 [2024-10-31 21:59:23,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2024-10-31 21:59:23,026 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 1623 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1623 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:23,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1623 Valid, 2096 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-31 21:59:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-31 21:59:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 166. [2024-10-31 21:59:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 165 states have internal predecessors, (205), 0 states have call successors, (0), 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-10-31 21:59:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 205 transitions. [2024-10-31 21:59:23,037 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 205 transitions. Word has length 51 [2024-10-31 21:59:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:23,038 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 205 transitions. [2024-10-31 21:59:23,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-31 21:59:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 205 transitions. [2024-10-31 21:59:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-31 21:59:23,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:23,041 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] [2024-10-31 21:59:23,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:59:23,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:23,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:23,042 INFO L85 PathProgramCache]: Analyzing trace with hash 766441193, now seen corresponding path program 1 times [2024-10-31 21:59:23,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:23,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739558142] [2024-10-31 21:59:23,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:23,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:23,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:23,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739558142] [2024-10-31 21:59:23,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739558142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:23,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:23,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 21:59:23,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304755906] [2024-10-31 21:59:23,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:23,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 21:59:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:23,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 21:59:23,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:59:23,767 INFO L87 Difference]: Start difference. First operand 166 states and 205 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-31 21:59:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:24,556 INFO L93 Difference]: Finished difference Result 285 states and 370 transitions. [2024-10-31 21:59:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 21:59:24,557 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-31 21:59:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:24,560 INFO L225 Difference]: With dead ends: 285 [2024-10-31 21:59:24,560 INFO L226 Difference]: Without dead ends: 238 [2024-10-31 21:59:24,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-31 21:59:24,562 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1029 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:24,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 818 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-31 21:59:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 162. [2024-10-31 21:59:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 156 states have (on average 1.2820512820512822) internal successors, (200), 161 states have internal predecessors, (200), 0 states have call successors, (0), 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-10-31 21:59:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2024-10-31 21:59:24,574 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 51 [2024-10-31 21:59:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:24,578 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-10-31 21:59:24,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-31 21:59:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2024-10-31 21:59:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-31 21:59:24,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:24,580 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] [2024-10-31 21:59:24,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:59:24,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:24,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1014075955, now seen corresponding path program 1 times [2024-10-31 21:59:24,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:24,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299074082] [2024-10-31 21:59:24,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:24,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:25,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:25,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299074082] [2024-10-31 21:59:25,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299074082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:25,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:25,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 21:59:25,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485286842] [2024-10-31 21:59:25,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:25,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 21:59:25,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:25,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 21:59:25,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:59:25,239 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-31 21:59:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:25,863 INFO L93 Difference]: Finished difference Result 391 states and 512 transitions. [2024-10-31 21:59:25,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 21:59:25,864 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-31 21:59:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:25,865 INFO L225 Difference]: With dead ends: 391 [2024-10-31 21:59:25,866 INFO L226 Difference]: Without dead ends: 319 [2024-10-31 21:59:25,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-10-31 21:59:25,867 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 758 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:25,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 941 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-31 21:59:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 133. [2024-10-31 21:59:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 132 states have internal predecessors, (166), 0 states have call successors, (0), 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-10-31 21:59:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 166 transitions. [2024-10-31 21:59:25,875 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 166 transitions. Word has length 51 [2024-10-31 21:59:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:25,875 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 166 transitions. [2024-10-31 21:59:25,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-31 21:59:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 166 transitions. [2024-10-31 21:59:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-31 21:59:25,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:25,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] [2024-10-31 21:59:25,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:59:25,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:25,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1185149594, now seen corresponding path program 1 times [2024-10-31 21:59:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122196251] [2024-10-31 21:59:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:26,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122196251] [2024-10-31 21:59:26,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122196251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:26,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:26,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:59:26,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403963142] [2024-10-31 21:59:26,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:26,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 21:59:26,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:26,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 21:59:26,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:26,292 INFO L87 Difference]: Start difference. First operand 133 states and 166 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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-10-31 21:59:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:26,727 INFO L93 Difference]: Finished difference Result 204 states and 259 transitions. [2024-10-31 21:59:26,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 21:59:26,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-31 21:59:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:26,728 INFO L225 Difference]: With dead ends: 204 [2024-10-31 21:59:26,728 INFO L226 Difference]: Without dead ends: 197 [2024-10-31 21:59:26,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-31 21:59:26,730 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 666 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:26,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 385 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-31 21:59:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 133. [2024-10-31 21:59:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 132 states have internal predecessors, (164), 0 states have call successors, (0), 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-10-31 21:59:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2024-10-31 21:59:26,735 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 52 [2024-10-31 21:59:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:26,736 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2024-10-31 21:59:26,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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-10-31 21:59:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2024-10-31 21:59:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-31 21:59:26,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:26,738 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] [2024-10-31 21:59:26,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:59:26,738 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:26,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1721906586, now seen corresponding path program 1 times [2024-10-31 21:59:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:26,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353025504] [2024-10-31 21:59:26,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:26,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:27,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:27,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353025504] [2024-10-31 21:59:27,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353025504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:27,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:27,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:59:27,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808227378] [2024-10-31 21:59:27,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:27,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 21:59:27,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:27,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 21:59:27,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:27,010 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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-10-31 21:59:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:27,494 INFO L93 Difference]: Finished difference Result 266 states and 342 transitions. [2024-10-31 21:59:27,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 21:59:27,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-31 21:59:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:27,496 INFO L225 Difference]: With dead ends: 266 [2024-10-31 21:59:27,496 INFO L226 Difference]: Without dead ends: 205 [2024-10-31 21:59:27,497 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-10-31 21:59:27,498 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 309 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:27,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 630 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-31 21:59:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 133. [2024-10-31 21:59:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.255813953488372) internal successors, (162), 132 states have internal predecessors, (162), 0 states have call successors, (0), 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-10-31 21:59:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2024-10-31 21:59:27,503 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 52 [2024-10-31 21:59:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:27,503 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2024-10-31 21:59:27,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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-10-31 21:59:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2024-10-31 21:59:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-31 21:59:27,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:27,504 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] [2024-10-31 21:59:27,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:59:27,505 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:27,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:27,505 INFO L85 PathProgramCache]: Analyzing trace with hash -314743810, now seen corresponding path program 1 times [2024-10-31 21:59:27,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:27,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127319469] [2024-10-31 21:59:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:27,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:28,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:28,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127319469] [2024-10-31 21:59:28,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127319469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:28,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:28,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-31 21:59:28,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507990038] [2024-10-31 21:59:28,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:28,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 21:59:28,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 21:59:28,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-31 21:59:28,257 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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-10-31 21:59:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:28,976 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2024-10-31 21:59:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 21:59:28,977 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-31 21:59:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:28,978 INFO L225 Difference]: With dead ends: 203 [2024-10-31 21:59:28,978 INFO L226 Difference]: Without dead ends: 187 [2024-10-31 21:59:28,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2024-10-31 21:59:28,979 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 113 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:28,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1401 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 21:59:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-31 21:59:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 125. [2024-10-31 21:59:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 124 states have internal predecessors, (152), 0 states have call successors, (0), 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-10-31 21:59:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2024-10-31 21:59:28,986 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 52 [2024-10-31 21:59:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:28,986 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2024-10-31 21:59:28,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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-10-31 21:59:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2024-10-31 21:59:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-31 21:59:28,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:28,988 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] [2024-10-31 21:59:28,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:59:28,989 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 653628022, now seen corresponding path program 1 times [2024-10-31 21:59:28,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:28,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750737825] [2024-10-31 21:59:28,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750737825] [2024-10-31 21:59:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750737825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:29,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:29,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-31 21:59:29,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872270838] [2024-10-31 21:59:29,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:29,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-31 21:59:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:29,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-31 21:59:29,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-31 21:59:29,786 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 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-10-31 21:59:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:31,068 INFO L93 Difference]: Finished difference Result 310 states and 403 transitions. [2024-10-31 21:59:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-31 21:59:31,069 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-31 21:59:31,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:31,070 INFO L225 Difference]: With dead ends: 310 [2024-10-31 21:59:31,070 INFO L226 Difference]: Without dead ends: 302 [2024-10-31 21:59:31,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2024-10-31 21:59:31,071 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 688 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:31,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 2317 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 21:59:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-31 21:59:31,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 125. [2024-10-31 21:59:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2377049180327868) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 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-10-31 21:59:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2024-10-31 21:59:31,078 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 54 [2024-10-31 21:59:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:31,078 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2024-10-31 21:59:31,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 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-10-31 21:59:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2024-10-31 21:59:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-31 21:59:31,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:31,079 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] [2024-10-31 21:59:31,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:59:31,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:31,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:31,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1899159370, now seen corresponding path program 1 times [2024-10-31 21:59:31,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:31,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136680265] [2024-10-31 21:59:31,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:31,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:31,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136680265] [2024-10-31 21:59:31,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136680265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:31,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:31,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-31 21:59:31,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217732487] [2024-10-31 21:59:31,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:31,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-31 21:59:31,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-31 21:59:31,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-10-31 21:59:31,998 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 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-10-31 21:59:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:33,409 INFO L93 Difference]: Finished difference Result 311 states and 406 transitions. [2024-10-31 21:59:33,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-31 21:59:33,410 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-31 21:59:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:33,411 INFO L225 Difference]: With dead ends: 311 [2024-10-31 21:59:33,412 INFO L226 Difference]: Without dead ends: 305 [2024-10-31 21:59:33,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2024-10-31 21:59:33,413 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 985 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:33,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 2192 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 21:59:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-31 21:59:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 131. [2024-10-31 21:59:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 128 states have (on average 1.2421875) internal successors, (159), 130 states have internal predecessors, (159), 0 states have call successors, (0), 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-10-31 21:59:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 159 transitions. [2024-10-31 21:59:33,420 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 159 transitions. Word has length 54 [2024-10-31 21:59:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:33,421 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 159 transitions. [2024-10-31 21:59:33,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 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-10-31 21:59:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 159 transitions. [2024-10-31 21:59:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-31 21:59:33,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:33,422 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] [2024-10-31 21:59:33,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 21:59:33,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:33,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:33,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2098262835, now seen corresponding path program 1 times [2024-10-31 21:59:33,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:33,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648458420] [2024-10-31 21:59:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:33,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:33,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648458420] [2024-10-31 21:59:33,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648458420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:33,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:33,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 21:59:33,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569405891] [2024-10-31 21:59:33,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:33,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 21:59:33,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:33,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 21:59:33,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:59:33,996 INFO L87 Difference]: Start difference. First operand 131 states and 159 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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-10-31 21:59:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:34,501 INFO L93 Difference]: Finished difference Result 187 states and 239 transitions. [2024-10-31 21:59:34,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 21:59:34,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-31 21:59:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:34,504 INFO L225 Difference]: With dead ends: 187 [2024-10-31 21:59:34,504 INFO L226 Difference]: Without dead ends: 181 [2024-10-31 21:59:34,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-10-31 21:59:34,506 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 211 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:34,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 778 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-31 21:59:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 119. [2024-10-31 21:59:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 118 states have internal predecessors, (145), 0 states have call successors, (0), 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-10-31 21:59:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2024-10-31 21:59:34,512 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 55 [2024-10-31 21:59:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:34,512 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2024-10-31 21:59:34,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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-10-31 21:59:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2024-10-31 21:59:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-31 21:59:34,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:34,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:59:34,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 21:59:34,514 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:34,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:34,515 INFO L85 PathProgramCache]: Analyzing trace with hash -220748721, now seen corresponding path program 1 times [2024-10-31 21:59:34,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:34,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105253708] [2024-10-31 21:59:34,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:34,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:35,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:35,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105253708] [2024-10-31 21:59:35,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105253708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:35,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:35,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-31 21:59:35,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847776451] [2024-10-31 21:59:35,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:35,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-31 21:59:35,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:35,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-31 21:59:35,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-31 21:59:35,569 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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-10-31 21:59:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:37,021 INFO L93 Difference]: Finished difference Result 231 states and 303 transitions. [2024-10-31 21:59:37,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-31 21:59:37,022 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-31 21:59:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:37,023 INFO L225 Difference]: With dead ends: 231 [2024-10-31 21:59:37,023 INFO L226 Difference]: Without dead ends: 219 [2024-10-31 21:59:37,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2024-10-31 21:59:37,025 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 704 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:37,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1820 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 21:59:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-31 21:59:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 101. [2024-10-31 21:59:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.26) internal successors, (126), 100 states have internal predecessors, (126), 0 states have call successors, (0), 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-10-31 21:59:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2024-10-31 21:59:37,030 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 55 [2024-10-31 21:59:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:37,030 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2024-10-31 21:59:37,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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-10-31 21:59:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2024-10-31 21:59:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-31 21:59:37,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:37,031 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-10-31 21:59:37,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 21:59:37,031 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:37,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:37,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1406506919, now seen corresponding path program 1 times [2024-10-31 21:59:37,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:37,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138408130] [2024-10-31 21:59:37,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:37,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:37,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138408130] [2024-10-31 21:59:37,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138408130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:37,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:37,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:37,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163528776] [2024-10-31 21:59:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:37,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:37,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:37,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:37,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:37,134 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-10-31 21:59:37,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:37,223 INFO L93 Difference]: Finished difference Result 359 states and 510 transitions. [2024-10-31 21:59:37,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:59:37,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-10-31 21:59:37,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:37,225 INFO L225 Difference]: With dead ends: 359 [2024-10-31 21:59:37,225 INFO L226 Difference]: Without dead ends: 316 [2024-10-31 21:59:37,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:59:37,227 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 530 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:37,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 459 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-31 21:59:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 142. [2024-10-31 21:59:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.326241134751773) internal successors, (187), 141 states have internal predecessors, (187), 0 states have call successors, (0), 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-10-31 21:59:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 187 transitions. [2024-10-31 21:59:37,233 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 187 transitions. Word has length 72 [2024-10-31 21:59:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:37,233 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 187 transitions. [2024-10-31 21:59:37,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-10-31 21:59:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 187 transitions. [2024-10-31 21:59:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-31 21:59:37,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:37,234 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-10-31 21:59:37,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 21:59:37,235 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:37,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1673936966, now seen corresponding path program 1 times [2024-10-31 21:59:37,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:37,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972325981] [2024-10-31 21:59:37,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:37,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:37,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972325981] [2024-10-31 21:59:37,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972325981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:37,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:37,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:37,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170822302] [2024-10-31 21:59:37,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:37,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:37,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:37,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:37,342 INFO L87 Difference]: Start difference. First operand 142 states and 187 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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-10-31 21:59:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:37,438 INFO L93 Difference]: Finished difference Result 437 states and 624 transitions. [2024-10-31 21:59:37,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:37,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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-10-31 21:59:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:37,440 INFO L225 Difference]: With dead ends: 437 [2024-10-31 21:59:37,441 INFO L226 Difference]: Without dead ends: 353 [2024-10-31 21:59:37,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:37,441 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 292 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:37,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 416 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:59:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-31 21:59:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 224. [2024-10-31 21:59:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.390134529147982) internal successors, (310), 223 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:59:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions. [2024-10-31 21:59:37,450 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 74 [2024-10-31 21:59:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:37,450 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions. [2024-10-31 21:59:37,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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-10-31 21:59:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions. [2024-10-31 21:59:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-31 21:59:37,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:37,452 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-10-31 21:59:37,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 21:59:37,452 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:37,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:37,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1695280855, now seen corresponding path program 1 times [2024-10-31 21:59:37,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:37,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617878516] [2024-10-31 21:59:37,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:37,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:37,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617878516] [2024-10-31 21:59:37,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617878516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:37,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:37,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:37,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83554912] [2024-10-31 21:59:37,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:37,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:37,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:37,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:37,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:37,516 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-10-31 21:59:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:37,548 INFO L93 Difference]: Finished difference Result 392 states and 559 transitions. [2024-10-31 21:59:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:37,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-10-31 21:59:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:37,550 INFO L225 Difference]: With dead ends: 392 [2024-10-31 21:59:37,550 INFO L226 Difference]: Without dead ends: 226 [2024-10-31 21:59:37,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:37,551 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:37,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 200 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-31 21:59:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2024-10-31 21:59:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.3811659192825112) internal successors, (308), 223 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-10-31 21:59:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 308 transitions. [2024-10-31 21:59:37,558 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 308 transitions. Word has length 74 [2024-10-31 21:59:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:37,559 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 308 transitions. [2024-10-31 21:59:37,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-10-31 21:59:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 308 transitions. [2024-10-31 21:59:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-31 21:59:37,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:37,560 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-10-31 21:59:37,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 21:59:37,561 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-31 21:59:37,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:37,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1859946120, now seen corresponding path program 1 times [2024-10-31 21:59:37,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:37,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860260966] [2024-10-31 21:59:37,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:37,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:37,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:37,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860260966] [2024-10-31 21:59:37,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860260966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:37,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:37,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:59:37,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526773591] [2024-10-31 21:59:37,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:37,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:37,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:37,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:37,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:37,647 INFO L87 Difference]: Start difference. First operand 224 states and 308 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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)