./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --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 dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 20:56:35,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:56:35,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:56:35,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:56:35,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:56:35,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:56:35,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:56:35,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:56:35,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:56:35,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:56:35,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:56:35,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:56:35,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:56:35,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:56:35,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:56:35,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:56:35,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:56:35,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:56:35,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:56:35,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:56:35,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:56:35,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:56:35,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:56:35,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:56:35,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:56:35,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:56:35,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:56:35,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:56:35,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:56:35,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:56:35,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:56:35,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:56:35,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:56:35,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:56:35,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:56:35,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:56:35,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:56:35,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:56:35,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:56:35,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:56:35,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:56:35,823 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:56:35,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:56:35,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:56:35,844 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:56:35,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:56:35,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:56:35,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:56:35,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:56:35,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:56:35,846 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:56:35,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:56:35,852 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:56:35,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:56:35,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:56:35,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:56:35,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:56:35,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:56:35,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:56:35,854 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:56:35,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:56:35,854 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:56:35,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:56:35,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:56:35,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:56:35,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:56:35,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:56:35,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:56:35,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:56:35,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:56:35,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:56:35,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:56:35,856 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:56:35,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:56:35,856 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:56:35,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:56:35,856 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:56:35,856 INFO L138 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee [2022-12-13 20:56:36,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:56:36,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:56:36,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:56:36,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:56:36,064 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:56:36,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/forester-heap/dll-01-1.i [2022-12-13 20:56:38,565 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:56:38,751 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:56:38,751 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i [2022-12-13 20:56:38,760 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/data/4d89b4794/93273ba61c3a4befb0f1bb9eb3e0e21b/FLAG62414d7c5 [2022-12-13 20:56:39,142 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/data/4d89b4794/93273ba61c3a4befb0f1bb9eb3e0e21b [2022-12-13 20:56:39,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:56:39,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:56:39,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:56:39,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:56:39,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:56:39,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671e1ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39, skipping insertion in model container [2022-12-13 20:56:39,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:56:39,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:56:39,342 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2022-12-13 20:56:39,347 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2022-12-13 20:56:39,349 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2022-12-13 20:56:39,350 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2022-12-13 20:56:39,352 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2022-12-13 20:56:39,353 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2022-12-13 20:56:39,354 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2022-12-13 20:56:39,355 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2022-12-13 20:56:39,356 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2022-12-13 20:56:39,356 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2022-12-13 20:56:39,358 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2022-12-13 20:56:39,358 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2022-12-13 20:56:39,359 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2022-12-13 20:56:39,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:56:39,369 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:56:39,391 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2022-12-13 20:56:39,393 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2022-12-13 20:56:39,395 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2022-12-13 20:56:39,395 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2022-12-13 20:56:39,397 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2022-12-13 20:56:39,398 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2022-12-13 20:56:39,399 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2022-12-13 20:56:39,400 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2022-12-13 20:56:39,401 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2022-12-13 20:56:39,401 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2022-12-13 20:56:39,403 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2022-12-13 20:56:39,403 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2022-12-13 20:56:39,404 WARN L237 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_2b8041cc-d866-4c18-a8fa-81fe7ff77412/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2022-12-13 20:56:39,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:56:39,421 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:56:39,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39 WrapperNode [2022-12-13 20:56:39,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:56:39,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:56:39,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:56:39,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:56:39,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,450 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2022-12-13 20:56:39,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:56:39,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:56:39,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:56:39,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:56:39,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,479 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:56:39,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:56:39,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:56:39,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:56:39,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (1/1) ... [2022-12-13 20:56:39,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:56:39,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:56:39,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:56:39,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:56:39,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 20:56:39,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:56:39,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 20:56:39,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 20:56:39,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:56:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:56:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:56:39,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:56:39,628 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:56:39,629 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:56:39,877 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:56:39,884 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:56:39,884 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-12-13 20:56:39,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:56:39 BoogieIcfgContainer [2022-12-13 20:56:39,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:56:39,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:56:39,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:56:39,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:56:39,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:56:39" (1/3) ... [2022-12-13 20:56:39,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c998c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:56:39, skipping insertion in model container [2022-12-13 20:56:39,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:56:39" (2/3) ... [2022-12-13 20:56:39,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c998c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:56:39, skipping insertion in model container [2022-12-13 20:56:39,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:56:39" (3/3) ... [2022-12-13 20:56:39,894 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2022-12-13 20:56:39,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:56:39,913 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-12-13 20:56:39,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:56:39,957 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1f81288, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:56:39,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 20:56:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 20:56:39,965 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:39,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 20:56:39,965 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:39,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-12-13 20:56:39,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:39,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591526590] [2022-12-13 20:56:39,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:40,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:40,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591526590] [2022-12-13 20:56:40,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591526590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:40,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:40,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:40,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262090622] [2022-12-13 20:56:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:40,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:40,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:40,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:40,153 INFO L87 Difference]: Start difference. First operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:40,203 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2022-12-13 20:56:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:40,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-13 20:56:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:40,210 INFO L225 Difference]: With dead ends: 180 [2022-12-13 20:56:40,210 INFO L226 Difference]: Without dead ends: 95 [2022-12-13 20:56:40,212 INFO L412 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 [2022-12-13 20:56:40,214 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 83 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:40,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-13 20:56:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2022-12-13 20:56:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-12-13 20:56:40,239 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2022-12-13 20:56:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:40,239 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-12-13 20:56:40,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-12-13 20:56:40,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 20:56:40,240 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:40,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:40,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:56:40,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:40,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:40,241 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2022-12-13 20:56:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:40,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817109449] [2022-12-13 20:56:40,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:40,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:40,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:40,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817109449] [2022-12-13 20:56:40,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817109449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:40,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:40,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:40,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443750811] [2022-12-13 20:56:40,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:40,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:40,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:40,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:40,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:40,303 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:40,320 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-12-13 20:56:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:40,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-13 20:56:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:40,322 INFO L225 Difference]: With dead ends: 80 [2022-12-13 20:56:40,322 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 20:56:40,322 INFO L412 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 [2022-12-13 20:56:40,323 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:40,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 20:56:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-12-13 20:56:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-12-13 20:56:40,331 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2022-12-13 20:56:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:40,331 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-12-13 20:56:40,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-12-13 20:56:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 20:56:40,332 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:40,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:40,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:56:40,333 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2022-12-13 20:56:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:40,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262084105] [2022-12-13 20:56:40,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:40,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:40,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:40,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262084105] [2022-12-13 20:56:40,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262084105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:40,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:40,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:40,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433347543] [2022-12-13 20:56:40,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:40,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:40,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:40,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:40,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:40,488 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:40,560 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-12-13 20:56:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:56:40,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-13 20:56:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:40,562 INFO L225 Difference]: With dead ends: 79 [2022-12-13 20:56:40,562 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 20:56:40,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:40,563 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:40,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:56:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 20:56:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-12-13 20:56:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.3125) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-12-13 20:56:40,572 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2022-12-13 20:56:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:40,572 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-12-13 20:56:40,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-12-13 20:56:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 20:56:40,573 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:40,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:40,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:56:40,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:40,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:40,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2022-12-13 20:56:40,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:40,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834136912] [2022-12-13 20:56:40,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:40,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834136912] [2022-12-13 20:56:40,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834136912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:40,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:40,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355162925] [2022-12-13 20:56:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:40,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:40,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:40,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:40,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:40,757 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:40,852 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2022-12-13 20:56:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:56:40,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-12-13 20:56:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:40,854 INFO L225 Difference]: With dead ends: 195 [2022-12-13 20:56:40,854 INFO L226 Difference]: Without dead ends: 128 [2022-12-13 20:56:40,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:40,855 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 56 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:40,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 199 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:56:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-12-13 20:56:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2022-12-13 20:56:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.303030303030303) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-12-13 20:56:40,865 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2022-12-13 20:56:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:40,865 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-12-13 20:56:40,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-12-13 20:56:40,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 20:56:40,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:40,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:40,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:56:40,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:40,867 INFO L85 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2022-12-13 20:56:40,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:40,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429160832] [2022-12-13 20:56:40,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:40,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:41,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:41,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429160832] [2022-12-13 20:56:41,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429160832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:41,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:41,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:56:41,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405988574] [2022-12-13 20:56:41,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:41,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:56:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:41,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:56:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:41,117 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:41,220 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-12-13 20:56:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:56:41,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-12-13 20:56:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:41,221 INFO L225 Difference]: With dead ends: 122 [2022-12-13 20:56:41,221 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 20:56:41,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:56:41,222 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 151 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:41,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 157 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:56:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 20:56:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2022-12-13 20:56:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.28125) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-12-13 20:56:41,230 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2022-12-13 20:56:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:41,231 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-12-13 20:56:41,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-12-13 20:56:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 20:56:41,231 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:41,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:41,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:56:41,232 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:41,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:41,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2022-12-13 20:56:41,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:41,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108354879] [2022-12-13 20:56:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:41,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:41,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:41,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108354879] [2022-12-13 20:56:41,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108354879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:41,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:41,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:41,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410275402] [2022-12-13 20:56:41,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:41,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:41,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:41,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:41,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:41,279 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:41,339 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2022-12-13 20:56:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:56:41,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-12-13 20:56:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:41,340 INFO L225 Difference]: With dead ends: 132 [2022-12-13 20:56:41,340 INFO L226 Difference]: Without dead ends: 112 [2022-12-13 20:56:41,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:41,341 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 131 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:41,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 116 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-13 20:56:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2022-12-13 20:56:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-12-13 20:56:41,350 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2022-12-13 20:56:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:41,350 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-12-13 20:56:41,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-12-13 20:56:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 20:56:41,351 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:41,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:41,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:56:41,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:41,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:41,352 INFO L85 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2022-12-13 20:56:41,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:41,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863852664] [2022-12-13 20:56:41,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:41,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:41,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:41,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863852664] [2022-12-13 20:56:41,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863852664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:41,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:41,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:41,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282309423] [2022-12-13 20:56:41,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:41,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:41,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:41,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:41,390 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:41,406 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-12-13 20:56:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:41,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-12-13 20:56:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:41,407 INFO L225 Difference]: With dead ends: 137 [2022-12-13 20:56:41,407 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 20:56:41,408 INFO L412 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 [2022-12-13 20:56:41,408 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:41,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 20:56:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2022-12-13 20:56:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-12-13 20:56:41,417 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2022-12-13 20:56:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:41,417 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-12-13 20:56:41,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-12-13 20:56:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 20:56:41,418 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:41,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:41,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:56:41,418 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2022-12-13 20:56:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:41,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117750026] [2022-12-13 20:56:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:41,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:41,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:41,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117750026] [2022-12-13 20:56:41,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117750026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:41,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:41,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:41,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198950826] [2022-12-13 20:56:41,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:41,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:41,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:41,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:41,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:41,452 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:41,465 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-12-13 20:56:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:41,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-13 20:56:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:41,466 INFO L225 Difference]: With dead ends: 75 [2022-12-13 20:56:41,466 INFO L226 Difference]: Without dead ends: 73 [2022-12-13 20:56:41,466 INFO L412 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 [2022-12-13 20:56:41,466 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:41,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-13 20:56:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-12-13 20:56:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-12-13 20:56:41,472 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2022-12-13 20:56:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:41,472 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-12-13 20:56:41,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-12-13 20:56:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 20:56:41,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:41,472 INFO L195 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] [2022-12-13 20:56:41,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:56:41,473 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:41,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2022-12-13 20:56:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:41,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000590151] [2022-12-13 20:56:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:41,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:41,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000590151] [2022-12-13 20:56:41,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000590151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:41,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:41,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964050907] [2022-12-13 20:56:41,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:41,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:41,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:41,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:41,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:41,573 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:41,629 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-12-13 20:56:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:56:41,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-12-13 20:56:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:41,629 INFO L225 Difference]: With dead ends: 74 [2022-12-13 20:56:41,629 INFO L226 Difference]: Without dead ends: 72 [2022-12-13 20:56:41,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:41,630 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:41,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-13 20:56:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-12-13 20:56:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-12-13 20:56:41,635 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2022-12-13 20:56:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:41,635 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-12-13 20:56:41,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-12-13 20:56:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 20:56:41,636 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:41,636 INFO L195 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] [2022-12-13 20:56:41,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:56:41,636 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:41,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2022-12-13 20:56:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:41,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881895062] [2022-12-13 20:56:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:41,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:41,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881895062] [2022-12-13 20:56:41,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881895062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:41,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:41,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:56:41,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39512702] [2022-12-13 20:56:41,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:41,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:56:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:41,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:56:41,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:56:41,756 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:41,931 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2022-12-13 20:56:41,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:56:41,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-12-13 20:56:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:41,932 INFO L225 Difference]: With dead ends: 175 [2022-12-13 20:56:41,932 INFO L226 Difference]: Without dead ends: 133 [2022-12-13 20:56:41,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:56:41,933 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 164 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:41,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 229 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:56:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-12-13 20:56:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2022-12-13 20:56:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-12-13 20:56:41,944 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2022-12-13 20:56:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:41,944 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-12-13 20:56:41,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-12-13 20:56:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 20:56:41,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:41,945 INFO L195 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] [2022-12-13 20:56:41,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:56:41,945 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:41,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:41,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2022-12-13 20:56:41,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:41,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951356069] [2022-12-13 20:56:41,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:41,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:43,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:43,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951356069] [2022-12-13 20:56:43,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951356069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:43,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:43,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:56:43,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671160534] [2022-12-13 20:56:43,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:43,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:56:43,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:43,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:56:43,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:56:43,293 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:43,751 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2022-12-13 20:56:43,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:56:43,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-12-13 20:56:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:43,754 INFO L225 Difference]: With dead ends: 234 [2022-12-13 20:56:43,754 INFO L226 Difference]: Without dead ends: 232 [2022-12-13 20:56:43,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:56:43,755 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 258 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:43,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 420 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 20:56:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-12-13 20:56:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 93. [2022-12-13 20:56:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 92 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2022-12-13 20:56:43,773 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2022-12-13 20:56:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:43,773 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2022-12-13 20:56:43,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-12-13 20:56:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 20:56:43,774 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:43,774 INFO L195 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] [2022-12-13 20:56:43,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 20:56:43,775 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:43,775 INFO L85 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2022-12-13 20:56:43,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:43,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387984348] [2022-12-13 20:56:43,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:43,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:56:43,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:43,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387984348] [2022-12-13 20:56:43,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387984348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:43,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:43,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:56:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753137492] [2022-12-13 20:56:43,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:43,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:56:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:43,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:56:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:43,843 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:43,949 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2022-12-13 20:56:43,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:56:43,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-12-13 20:56:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:43,950 INFO L225 Difference]: With dead ends: 139 [2022-12-13 20:56:43,950 INFO L226 Difference]: Without dead ends: 121 [2022-12-13 20:56:43,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:56:43,951 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 44 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:43,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 186 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:56:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-13 20:56:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2022-12-13 20:56:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 112 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2022-12-13 20:56:43,969 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2022-12-13 20:56:43,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:43,970 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2022-12-13 20:56:43,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2022-12-13 20:56:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 20:56:43,970 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:43,970 INFO L195 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] [2022-12-13 20:56:43,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 20:56:43,970 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:43,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2022-12-13 20:56:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:43,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848135968] [2022-12-13 20:56:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:56:44,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:44,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848135968] [2022-12-13 20:56:44,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848135968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:44,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:44,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:44,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855472029] [2022-12-13 20:56:44,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:44,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:44,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:44,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:44,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:44,012 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:56:44,063 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2022-12-13 20:56:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:44,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-12-13 20:56:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:56:44,064 INFO L225 Difference]: With dead ends: 113 [2022-12-13 20:56:44,064 INFO L226 Difference]: Without dead ends: 111 [2022-12-13 20:56:44,064 INFO L412 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 [2022-12-13 20:56:44,065 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:56:44,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:56:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-13 20:56:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-12-13 20:56:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2022-12-13 20:56:44,077 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 26 [2022-12-13 20:56:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:56:44,078 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2022-12-13 20:56:44,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2022-12-13 20:56:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 20:56:44,078 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:56:44,078 INFO L195 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] [2022-12-13 20:56:44,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 20:56:44,078 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-13 20:56:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:44,079 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2022-12-13 20:56:44,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:44,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282299088] [2022-12-13 20:56:44,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:44,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:56:44,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:56:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:56:44,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:56:44,127 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:56:44,128 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2022-12-13 20:56:44,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2022-12-13 20:56:44,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2022-12-13 20:56:44,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2022-12-13 20:56:44,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2022-12-13 20:56:44,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2022-12-13 20:56:44,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2022-12-13 20:56:44,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2022-12-13 20:56:44,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2022-12-13 20:56:44,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2022-12-13 20:56:44,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2022-12-13 20:56:44,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2022-12-13 20:56:44,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2022-12-13 20:56:44,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 20:56:44,133 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:44,136 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:56:44,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:56:44 BoogieIcfgContainer [2022-12-13 20:56:44,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:56:44,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:56:44,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:56:44,154 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:56:44,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:56:39" (3/4) ... [2022-12-13 20:56:44,156 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 20:56:44,180 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:56:44,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:56:44,181 INFO L158 Benchmark]: Toolchain (without parser) took 5036.02ms. Allocated memory was 121.6MB in the beginning and 182.5MB in the end (delta: 60.8MB). Free memory was 88.8MB in the beginning and 90.0MB in the end (delta: -1.2MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2022-12-13 20:56:44,181 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:56:44,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.34ms. Allocated memory is still 121.6MB. Free memory was 88.4MB in the beginning and 68.8MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 20:56:44,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.92ms. Allocated memory is still 121.6MB. Free memory was 68.8MB in the beginning and 66.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 20:56:44,182 INFO L158 Benchmark]: Boogie Preprocessor took 32.00ms. Allocated memory is still 121.6MB. Free memory was 66.3MB in the beginning and 64.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:56:44,182 INFO L158 Benchmark]: RCFGBuilder took 402.39ms. Allocated memory is still 121.6MB. Free memory was 64.2MB in the beginning and 89.6MB in the end (delta: -25.4MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2022-12-13 20:56:44,182 INFO L158 Benchmark]: TraceAbstraction took 4265.34ms. Allocated memory was 121.6MB in the beginning and 182.5MB in the end (delta: 60.8MB). Free memory was 89.0MB in the beginning and 92.1MB in the end (delta: -3.1MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2022-12-13 20:56:44,182 INFO L158 Benchmark]: Witness Printer took 26.53ms. Allocated memory is still 182.5MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:56:44,183 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.34ms. Allocated memory is still 121.6MB. Free memory was 88.4MB in the beginning and 68.8MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.92ms. Allocated memory is still 121.6MB. Free memory was 68.8MB in the beginning and 66.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.00ms. Allocated memory is still 121.6MB. Free memory was 66.3MB in the beginning and 64.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 402.39ms. Allocated memory is still 121.6MB. Free memory was 64.2MB in the beginning and 89.6MB in the end (delta: -25.4MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4265.34ms. Allocated memory was 121.6MB in the beginning and 182.5MB in the end (delta: 60.8MB). Free memory was 89.0MB in the beginning and 92.1MB in the end (delta: -3.1MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * Witness Printer took 26.53ms. Allocated memory is still 182.5MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) [L1005] list->prev = ((void*)0) VAL [list={-1:0}] [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) [L1006] EXPR list->inner [L1006] list->inner->next = ((void*)0) [L1006] EXPR list->inner [L1006] list->inner->inner = ((void*)0) [L1006] EXPR list->inner [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; [L1031] EXPR end->inner [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] - UnprovableResult [Line: 1006]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 974 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 974 mSDsluCounter, 2260 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1312 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 646 IncrementalHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 948 mSDtfsCounter, 646 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=12, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 377 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1501 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 20:56:44,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b8041cc-d866-4c18-a8fa-81fe7ff77412/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE