./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc --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 b52b7cb04206fcfe3f216083825f85a3c49ed6dc90ac2fa7b25183898e97828e --- 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-5e519f3 [2022-11-02 20:32:37,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:32:37,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:32:38,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:32:38,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:32:38,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:32:38,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:32:38,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:32:38,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:32:38,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:32:38,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:32:38,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:32:38,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:32:38,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:32:38,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:32:38,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:32:38,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:32:38,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:32:38,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:32:38,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:32:38,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:32:38,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:32:38,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:32:38,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:32:38,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:32:38,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:32:38,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:32:38,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:32:38,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:32:38,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:32:38,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:32:38,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:32:38,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:32:38,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:32:38,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:32:38,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:32:38,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:32:38,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:32:38,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:32:38,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:32:38,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:32:38,069 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:32:38,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:32:38,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:32:38,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:32:38,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:32:38,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:32:38,098 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:32:38,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:32:38,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:32:38,100 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:32:38,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:32:38,101 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:32:38,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:32:38,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:32:38,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:32:38,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:32:38,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:32:38,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:32:38,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:32:38,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:32:38,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:32:38,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:32:38,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:32:38,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:32:38,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:32:38,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:32:38,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:32:38,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:32:38,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:32:38,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:32:38,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:32:38,106 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:32:38,106 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:32:38,106 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:32:38,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/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_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc 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 -> b52b7cb04206fcfe3f216083825f85a3c49ed6dc90ac2fa7b25183898e97828e [2022-11-02 20:32:38,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:32:38,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:32:38,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:32:38,502 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:32:38,504 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:32:38,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-11-02 20:32:38,639 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/data/6d8f08fa2/9619facf17254988b8757b678990d72d/FLAGad56f72f9 [2022-11-02 20:32:39,694 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:32:39,695 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-11-02 20:32:39,734 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/data/6d8f08fa2/9619facf17254988b8757b678990d72d/FLAGad56f72f9 [2022-11-02 20:32:40,113 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/data/6d8f08fa2/9619facf17254988b8757b678990d72d [2022-11-02 20:32:40,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:32:40,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:32:40,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:32:40,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:32:40,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:32:40,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:40" (1/1) ... [2022-11-02 20:32:40,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc20f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:40, skipping insertion in model container [2022-11-02 20:32:40,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:40" (1/1) ... [2022-11-02 20:32:40,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:32:40,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:32:40,918 WARN L230 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_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c[20454,20467] [2022-11-02 20:32:41,000 WARN L230 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_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c[26009,26022] [2022-11-02 20:32:42,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:32:42,298 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:32:42,389 WARN L230 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_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c[20454,20467] [2022-11-02 20:32:42,410 WARN L230 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_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c[26009,26022] [2022-11-02 20:32:43,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:32:43,167 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:32:43,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43 WrapperNode [2022-11-02 20:32:43,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:32:43,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:32:43,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:32:43,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:32:43,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (1/1) ... [2022-11-02 20:32:43,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (1/1) ... [2022-11-02 20:32:43,675 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5208 [2022-11-02 20:32:43,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:32:43,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:32:43,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:32:43,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:32:43,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (1/1) ... [2022-11-02 20:32:43,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (1/1) ... [2022-11-02 20:32:43,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (1/1) ... [2022-11-02 20:32:43,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (1/1) ... [2022-11-02 20:32:44,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (1/1) ... [2022-11-02 20:32:44,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (1/1) ... [2022-11-02 20:32:44,174 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (1/1) ... [2022-11-02 20:32:44,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (1/1) ... [2022-11-02 20:32:44,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:32:44,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:32:44,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:32:44,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:32:44,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (1/1) ... [2022-11-02 20:32:44,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:32:44,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:44,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:32:44,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e2c9fc7-e65a-465f-a0fa-90174e9adad3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:32:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:32:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:32:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:32:44,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:32:44,700 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:32:44,702 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:32:51,330 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:32:51,348 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:32:51,348 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:32:51,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:51 BoogieIcfgContainer [2022-11-02 20:32:51,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:32:51,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:32:51,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:32:51,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:32:51,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:32:40" (1/3) ... [2022-11-02 20:32:51,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aa3699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:51, skipping insertion in model container [2022-11-02 20:32:51,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:43" (2/3) ... [2022-11-02 20:32:51,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aa3699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:51, skipping insertion in model container [2022-11-02 20:32:51,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:51" (3/3) ... [2022-11-02 20:32:51,367 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-11-02 20:32:51,391 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:32:51,391 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:32:51,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:32:51,545 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;@2fe60b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:32:51,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:32:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 946 states, 943 states have (on average 1.8971367974549311) internal successors, (1789), 945 states have internal predecessors, (1789), 0 states have call successors, (0), 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-11-02 20:32:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:32:51,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:51,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:51,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:32:51,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:51,582 INFO L85 PathProgramCache]: Analyzing trace with hash -949343158, now seen corresponding path program 1 times [2022-11-02 20:32:51,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:51,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945755056] [2022-11-02 20:32:51,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:51,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:51,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:51,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945755056] [2022-11-02 20:32:51,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945755056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:51,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:51,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:32:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849565564] [2022-11-02 20:32:51,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:51,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:32:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:52,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:32:52,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:32:52,032 INFO L87 Difference]: Start difference. First operand has 946 states, 943 states have (on average 1.8971367974549311) internal successors, (1789), 945 states have internal predecessors, (1789), 0 states have call successors, (0), 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 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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-11-02 20:32:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:52,165 INFO L93 Difference]: Finished difference Result 1834 states and 3468 transitions. [2022-11-02 20:32:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:32:52,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-11-02 20:32:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:52,200 INFO L225 Difference]: With dead ends: 1834 [2022-11-02 20:32:52,200 INFO L226 Difference]: Without dead ends: 880 [2022-11-02 20:32:52,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:32:52,224 INFO L413 NwaCegarLoop]: 1720 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:52,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:32:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-11-02 20:32:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2022-11-02 20:32:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.8861047835990887) internal successors, (1656), 879 states have internal predecessors, (1656), 0 states have call successors, (0), 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-11-02 20:32:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1656 transitions. [2022-11-02 20:32:52,347 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1656 transitions. Word has length 42 [2022-11-02 20:32:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:52,348 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1656 transitions. [2022-11-02 20:32:52,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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-11-02 20:32:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1656 transitions. [2022-11-02 20:32:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:32:52,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:52,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:32:52,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:32:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:52,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1343709944, now seen corresponding path program 1 times [2022-11-02 20:32:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:52,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799730673] [2022-11-02 20:32:52,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:52,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:52,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799730673] [2022-11-02 20:32:52,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799730673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:52,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:52,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:32:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285108942] [2022-11-02 20:32:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:52,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:32:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:32:52,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:32:52,660 INFO L87 Difference]: Start difference. First operand 880 states and 1656 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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-11-02 20:32:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:52,864 INFO L93 Difference]: Finished difference Result 954 states and 1771 transitions. [2022-11-02 20:32:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:32:52,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-11-02 20:32:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:52,869 INFO L225 Difference]: With dead ends: 954 [2022-11-02 20:32:52,870 INFO L226 Difference]: Without dead ends: 880 [2022-11-02 20:32:52,874 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-11-02 20:32:52,876 INFO L413 NwaCegarLoop]: 1654 mSDtfsCounter, 3 mSDsluCounter, 4909 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6563 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:52,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6563 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:32:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-11-02 20:32:52,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2022-11-02 20:32:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.8291571753986333) internal successors, (1606), 879 states have internal predecessors, (1606), 0 states have call successors, (0), 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-11-02 20:32:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1606 transitions. [2022-11-02 20:32:52,912 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1606 transitions. Word has length 42 [2022-11-02 20:32:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:52,913 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1606 transitions. [2022-11-02 20:32:52,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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-11-02 20:32:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1606 transitions. [2022-11-02 20:32:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:32:52,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:52,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:52,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:32:52,929 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:32:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:52,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1956123093, now seen corresponding path program 1 times [2022-11-02 20:32:52,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:52,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062857307] [2022-11-02 20:32:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:52,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:53,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:53,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062857307] [2022-11-02 20:32:53,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062857307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:53,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:53,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:32:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251125201] [2022-11-02 20:32:53,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:53,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:53,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:53,122 INFO L87 Difference]: Start difference. First operand 880 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:59,317 INFO L93 Difference]: Finished difference Result 2384 states and 4479 transitions. [2022-11-02 20:32:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:59,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-02 20:32:59,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:59,328 INFO L225 Difference]: With dead ends: 2384 [2022-11-02 20:32:59,328 INFO L226 Difference]: Without dead ends: 1631 [2022-11-02 20:32:59,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-02 20:32:59,332 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 934 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:59,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 244 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-02 20:32:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-11-02 20:32:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-11-02 20:32:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.8299570288520566) internal successors, (2981), 1630 states have internal predecessors, (2981), 0 states have call successors, (0), 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-11-02 20:32:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2981 transitions. [2022-11-02 20:32:59,391 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2981 transitions. Word has length 48 [2022-11-02 20:32:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:59,392 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 2981 transitions. [2022-11-02 20:32:59,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2981 transitions. [2022-11-02 20:32:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:32:59,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:59,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:32:59,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:32:59,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:32:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash -461668761, now seen corresponding path program 1 times [2022-11-02 20:32:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:59,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924205906] [2022-11-02 20:32:59,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:59,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:59,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:59,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924205906] [2022-11-02 20:32:59,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924205906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:59,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:59,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:32:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118154433] [2022-11-02 20:32:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:59,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:59,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:59,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:59,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:59,574 INFO L87 Difference]: Start difference. First operand 1631 states and 2981 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:32:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:59,630 INFO L93 Difference]: Finished difference Result 1765 states and 3193 transitions. [2022-11-02 20:32:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:59,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-11-02 20:32:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:59,640 INFO L225 Difference]: With dead ends: 1765 [2022-11-02 20:32:59,641 INFO L226 Difference]: Without dead ends: 1695 [2022-11-02 20:32:59,642 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-11-02 20:32:59,644 INFO L413 NwaCegarLoop]: 1674 mSDtfsCounter, 1532 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:59,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 1791 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:32:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2022-11-02 20:32:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2022-11-02 20:32:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.8214074512123004) internal successors, (3080), 1692 states have internal predecessors, (3080), 0 states have call successors, (0), 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-11-02 20:32:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 3080 transitions. [2022-11-02 20:32:59,748 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 3080 transitions. Word has length 91 [2022-11-02 20:32:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:59,749 INFO L495 AbstractCegarLoop]: Abstraction has 1693 states and 3080 transitions. [2022-11-02 20:32:59,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:32:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 3080 transitions. [2022-11-02 20:32:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:32:59,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:59,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:32:59,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:32:59,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:32:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1207251491, now seen corresponding path program 1 times [2022-11-02 20:32:59,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:59,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311103259] [2022-11-02 20:32:59,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:59,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311103259] [2022-11-02 20:32:59,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311103259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:59,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:59,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:32:59,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273355445] [2022-11-02 20:32:59,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:59,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:59,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:59,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:59,860 INFO L87 Difference]: Start difference. First operand 1693 states and 3080 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:32:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:59,924 INFO L93 Difference]: Finished difference Result 1945 states and 3480 transitions. [2022-11-02 20:32:59,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:59,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-11-02 20:32:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:59,937 INFO L225 Difference]: With dead ends: 1945 [2022-11-02 20:32:59,938 INFO L226 Difference]: Without dead ends: 1813 [2022-11-02 20:32:59,939 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-11-02 20:32:59,948 INFO L413 NwaCegarLoop]: 1669 mSDtfsCounter, 1528 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:59,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 1790 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:32:59,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-11-02 20:32:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1811. [2022-11-02 20:33:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1809 states have (on average 1.8059701492537314) internal successors, (3267), 1810 states have internal predecessors, (3267), 0 states have call successors, (0), 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-11-02 20:33:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 3267 transitions. [2022-11-02 20:33:00,010 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 3267 transitions. Word has length 91 [2022-11-02 20:33:00,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:00,015 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 3267 transitions. [2022-11-02 20:33:00,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:33:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3267 transitions. [2022-11-02 20:33:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:33:00,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:00,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:00,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:33:00,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1147684947, now seen corresponding path program 1 times [2022-11-02 20:33:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:00,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387696684] [2022-11-02 20:33:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:00,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387696684] [2022-11-02 20:33:00,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387696684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:00,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:00,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:33:00,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870933881] [2022-11-02 20:33:00,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:00,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:33:00,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:00,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:00,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:00,190 INFO L87 Difference]: Start difference. First operand 1811 states and 3267 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:33:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:00,265 INFO L93 Difference]: Finished difference Result 2287 states and 4021 transitions. [2022-11-02 20:33:00,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:00,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-11-02 20:33:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:00,280 INFO L225 Difference]: With dead ends: 2287 [2022-11-02 20:33:00,281 INFO L226 Difference]: Without dead ends: 2037 [2022-11-02 20:33:00,282 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-11-02 20:33:00,293 INFO L413 NwaCegarLoop]: 1664 mSDtfsCounter, 1524 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:00,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1789 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2022-11-02 20:33:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 2035. [2022-11-02 20:33:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2033 states have (on average 1.7801278898180029) internal successors, (3619), 2034 states have internal predecessors, (3619), 0 states have call successors, (0), 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-11-02 20:33:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 3619 transitions. [2022-11-02 20:33:00,365 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 3619 transitions. Word has length 91 [2022-11-02 20:33:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:00,366 INFO L495 AbstractCegarLoop]: Abstraction has 2035 states and 3619 transitions. [2022-11-02 20:33:00,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:33:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3619 transitions. [2022-11-02 20:33:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:33:00,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:00,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:00,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:33:00,369 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:00,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:00,369 INFO L85 PathProgramCache]: Analyzing trace with hash -446599735, now seen corresponding path program 1 times [2022-11-02 20:33:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:00,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244256661] [2022-11-02 20:33:00,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:00,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:00,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244256661] [2022-11-02 20:33:00,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244256661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:00,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:00,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:33:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083505496] [2022-11-02 20:33:00,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:00,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:33:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:00,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:00,461 INFO L87 Difference]: Start difference. First operand 2035 states and 3619 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:33:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:00,568 INFO L93 Difference]: Finished difference Result 2935 states and 5037 transitions. [2022-11-02 20:33:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:00,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-11-02 20:33:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:00,581 INFO L225 Difference]: With dead ends: 2935 [2022-11-02 20:33:00,581 INFO L226 Difference]: Without dead ends: 2461 [2022-11-02 20:33:00,583 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-11-02 20:33:00,584 INFO L413 NwaCegarLoop]: 1659 mSDtfsCounter, 1520 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:00,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1788 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2022-11-02 20:33:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2459. [2022-11-02 20:33:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2457 states have (on average 1.7415547415547417) internal successors, (4279), 2458 states have internal predecessors, (4279), 0 states have call successors, (0), 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-11-02 20:33:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4279 transitions. [2022-11-02 20:33:00,687 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4279 transitions. Word has length 91 [2022-11-02 20:33:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:00,688 INFO L495 AbstractCegarLoop]: Abstraction has 2459 states and 4279 transitions. [2022-11-02 20:33:00,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:33:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4279 transitions. [2022-11-02 20:33:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:33:00,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:00,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:00,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:33:00,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:00,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash -108806593, now seen corresponding path program 1 times [2022-11-02 20:33:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:00,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55114190] [2022-11-02 20:33:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:00,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:00,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:00,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55114190] [2022-11-02 20:33:00,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55114190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:00,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:00,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:33:00,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360530706] [2022-11-02 20:33:00,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:00,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:33:00,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:00,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:00,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:00,787 INFO L87 Difference]: Start difference. First operand 2459 states and 4279 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:33:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:00,936 INFO L93 Difference]: Finished difference Result 4159 states and 6937 transitions. [2022-11-02 20:33:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:00,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-11-02 20:33:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:00,952 INFO L225 Difference]: With dead ends: 4159 [2022-11-02 20:33:00,953 INFO L226 Difference]: Without dead ends: 3261 [2022-11-02 20:33:00,955 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-11-02 20:33:00,956 INFO L413 NwaCegarLoop]: 1654 mSDtfsCounter, 1516 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:00,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1787 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2022-11-02 20:33:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 3259. [2022-11-02 20:33:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 3257 states have (on average 1.6920478968375805) internal successors, (5511), 3258 states have internal predecessors, (5511), 0 states have call successors, (0), 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-11-02 20:33:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 5511 transitions. [2022-11-02 20:33:01,149 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 5511 transitions. Word has length 91 [2022-11-02 20:33:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:01,150 INFO L495 AbstractCegarLoop]: Abstraction has 3259 states and 5511 transitions. [2022-11-02 20:33:01,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:33:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 5511 transitions. [2022-11-02 20:33:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:33:01,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:01,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:01,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:33:01,154 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1109178805, now seen corresponding path program 1 times [2022-11-02 20:33:01,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:01,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223071776] [2022-11-02 20:33:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:01,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:01,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223071776] [2022-11-02 20:33:01,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223071776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:01,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:01,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:33:01,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248305961] [2022-11-02 20:33:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:01,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:33:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:01,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:33:01,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:33:01,583 INFO L87 Difference]: Start difference. First operand 3259 states and 5511 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:33:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:04,543 INFO L93 Difference]: Finished difference Result 27031 states and 42485 transitions. [2022-11-02 20:33:04,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:33:04,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-11-02 20:33:04,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:04,665 INFO L225 Difference]: With dead ends: 27031 [2022-11-02 20:33:04,665 INFO L226 Difference]: Without dead ends: 25333 [2022-11-02 20:33:04,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:33:04,680 INFO L413 NwaCegarLoop]: 1600 mSDtfsCounter, 12616 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12616 SdHoareTripleChecker+Valid, 4108 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:04,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12616 Valid, 4108 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:33:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25333 states. [2022-11-02 20:33:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25333 to 4955. [2022-11-02 20:33:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4955 states, 4953 states have (on average 1.6327478295982234) internal successors, (8087), 4954 states have internal predecessors, (8087), 0 states have call successors, (0), 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-11-02 20:33:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 8087 transitions. [2022-11-02 20:33:05,561 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 8087 transitions. Word has length 91 [2022-11-02 20:33:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:05,562 INFO L495 AbstractCegarLoop]: Abstraction has 4955 states and 8087 transitions. [2022-11-02 20:33:05,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-02 20:33:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 8087 transitions. [2022-11-02 20:33:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 20:33:05,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:05,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:05,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:33:05,565 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:05,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash -646747483, now seen corresponding path program 1 times [2022-11-02 20:33:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:05,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463543603] [2022-11-02 20:33:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:05,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:05,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:05,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463543603] [2022-11-02 20:33:05,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463543603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:05,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:05,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:33:05,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142834731] [2022-11-02 20:33:05,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:05,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:33:05,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:05,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:05,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:05,700 INFO L87 Difference]: Start difference. First operand 4955 states and 8087 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-11-02 20:33:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:06,818 INFO L93 Difference]: Finished difference Result 11391 states and 17913 transitions. [2022-11-02 20:33:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-11-02 20:33:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:06,843 INFO L225 Difference]: With dead ends: 11391 [2022-11-02 20:33:06,843 INFO L226 Difference]: Without dead ends: 7997 [2022-11-02 20:33:06,850 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-11-02 20:33:06,851 INFO L413 NwaCegarLoop]: 1602 mSDtfsCounter, 1507 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:06,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1706 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7997 states. [2022-11-02 20:33:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7997 to 7931. [2022-11-02 20:33:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7931 states, 7929 states have (on average 1.5728339008702232) internal successors, (12471), 7930 states have internal predecessors, (12471), 0 states have call successors, (0), 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-11-02 20:33:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7931 states to 7931 states and 12471 transitions. [2022-11-02 20:33:07,976 INFO L78 Accepts]: Start accepts. Automaton has 7931 states and 12471 transitions. Word has length 93 [2022-11-02 20:33:07,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:07,976 INFO L495 AbstractCegarLoop]: Abstraction has 7931 states and 12471 transitions. [2022-11-02 20:33:07,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-11-02 20:33:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7931 states and 12471 transitions. [2022-11-02 20:33:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 20:33:07,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:07,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:07,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:33:07,984 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:07,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash -580253971, now seen corresponding path program 1 times [2022-11-02 20:33:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:07,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669549985] [2022-11-02 20:33:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:08,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:08,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669549985] [2022-11-02 20:33:08,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669549985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:08,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:08,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:33:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654125020] [2022-11-02 20:33:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:08,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:33:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:08,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:33:08,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:33:08,610 INFO L87 Difference]: Start difference. First operand 7931 states and 12471 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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-11-02 20:33:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:10,245 INFO L93 Difference]: Finished difference Result 14303 states and 22073 transitions. [2022-11-02 20:33:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:33:10,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-11-02 20:33:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:10,269 INFO L225 Difference]: With dead ends: 14303 [2022-11-02 20:33:10,269 INFO L226 Difference]: Without dead ends: 7933 [2022-11-02 20:33:10,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:33:10,279 INFO L413 NwaCegarLoop]: 1644 mSDtfsCounter, 10977 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10977 SdHoareTripleChecker+Valid, 2292 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:10,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10977 Valid, 2292 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7933 states. [2022-11-02 20:33:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7933 to 7931. [2022-11-02 20:33:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7931 states, 7929 states have (on average 1.5647622651027873) internal successors, (12407), 7930 states have internal predecessors, (12407), 0 states have call successors, (0), 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-11-02 20:33:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7931 states to 7931 states and 12407 transitions. [2022-11-02 20:33:11,521 INFO L78 Accepts]: Start accepts. Automaton has 7931 states and 12407 transitions. Word has length 93 [2022-11-02 20:33:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:11,522 INFO L495 AbstractCegarLoop]: Abstraction has 7931 states and 12407 transitions. [2022-11-02 20:33:11,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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-11-02 20:33:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 7931 states and 12407 transitions. [2022-11-02 20:33:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 20:33:11,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:11,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:11,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:33:11,525 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1326262359, now seen corresponding path program 1 times [2022-11-02 20:33:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:11,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154554748] [2022-11-02 20:33:11,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:11,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:11,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:11,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154554748] [2022-11-02 20:33:11,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154554748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:11,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:11,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:33:11,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707507186] [2022-11-02 20:33:11,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:11,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:33:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:11,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:11,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:11,635 INFO L87 Difference]: Start difference. First operand 7931 states and 12407 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-11-02 20:33:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:12,930 INFO L93 Difference]: Finished difference Result 19903 states and 30201 transitions. [2022-11-02 20:33:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:12,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-11-02 20:33:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:12,967 INFO L225 Difference]: With dead ends: 19903 [2022-11-02 20:33:12,967 INFO L226 Difference]: Without dead ends: 13533 [2022-11-02 20:33:12,979 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-11-02 20:33:12,980 INFO L413 NwaCegarLoop]: 1688 mSDtfsCounter, 1536 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:12,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 1801 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13533 states. [2022-11-02 20:33:14,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13533 to 13531. [2022-11-02 20:33:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13531 states, 13529 states have (on average 1.517850543277404) internal successors, (20535), 13530 states have internal predecessors, (20535), 0 states have call successors, (0), 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-11-02 20:33:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13531 states to 13531 states and 20535 transitions. [2022-11-02 20:33:14,569 INFO L78 Accepts]: Start accepts. Automaton has 13531 states and 20535 transitions. Word has length 93 [2022-11-02 20:33:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:14,569 INFO L495 AbstractCegarLoop]: Abstraction has 13531 states and 20535 transitions. [2022-11-02 20:33:14,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-11-02 20:33:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 13531 states and 20535 transitions. [2022-11-02 20:33:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:33:14,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:14,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:14,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:33:14,573 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1222726774, now seen corresponding path program 1 times [2022-11-02 20:33:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:14,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575608152] [2022-11-02 20:33:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:15,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575608152] [2022-11-02 20:33:15,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575608152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:15,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:15,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:33:15,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533149796] [2022-11-02 20:33:15,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:15,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:33:15,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:15,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:33:15,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:33:15,110 INFO L87 Difference]: Start difference. First operand 13531 states and 20535 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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-11-02 20:33:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:18,778 INFO L93 Difference]: Finished difference Result 22401 states and 33447 transitions. [2022-11-02 20:33:18,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:33:18,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2022-11-02 20:33:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:18,838 INFO L225 Difference]: With dead ends: 22401 [2022-11-02 20:33:18,838 INFO L226 Difference]: Without dead ends: 22399 [2022-11-02 20:33:18,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:33:18,845 INFO L413 NwaCegarLoop]: 1659 mSDtfsCounter, 801 mSDsluCounter, 9281 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 10940 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:18,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 10940 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22399 states. [2022-11-02 20:33:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22399 to 13915. [2022-11-02 20:33:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13915 states, 13913 states have (on average 1.498957809243154) internal successors, (20855), 13914 states have internal predecessors, (20855), 0 states have call successors, (0), 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-11-02 20:33:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13915 states to 13915 states and 20855 transitions. [2022-11-02 20:33:20,756 INFO L78 Accepts]: Start accepts. Automaton has 13915 states and 20855 transitions. Word has length 94 [2022-11-02 20:33:20,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:20,757 INFO L495 AbstractCegarLoop]: Abstraction has 13915 states and 20855 transitions. [2022-11-02 20:33:20,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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-11-02 20:33:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 13915 states and 20855 transitions. [2022-11-02 20:33:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 20:33:20,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:20,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:20,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:33:20,760 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -362720764, now seen corresponding path program 1 times [2022-11-02 20:33:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:20,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955190028] [2022-11-02 20:33:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:20,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:20,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:20,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955190028] [2022-11-02 20:33:20,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955190028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:20,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:20,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:33:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735137523] [2022-11-02 20:33:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:20,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:33:20,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:20,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:20,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:20,845 INFO L87 Difference]: Start difference. First operand 13915 states and 20855 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-11-02 20:33:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:23,230 INFO L93 Difference]: Finished difference Result 26466 states and 39293 transitions. [2022-11-02 20:33:23,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:23,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-11-02 20:33:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:23,265 INFO L225 Difference]: With dead ends: 26466 [2022-11-02 20:33:23,266 INFO L226 Difference]: Without dead ends: 19679 [2022-11-02 20:33:23,277 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-11-02 20:33:23,278 INFO L413 NwaCegarLoop]: 1696 mSDtfsCounter, 1537 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:23,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 1805 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19679 states. [2022-11-02 20:33:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19679 to 19677. [2022-11-02 20:33:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19677 states, 19675 states have (on average 1.479695044472681) internal successors, (29113), 19676 states have internal predecessors, (29113), 0 states have call successors, (0), 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-11-02 20:33:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19677 states to 19677 states and 29113 transitions. [2022-11-02 20:33:26,399 INFO L78 Accepts]: Start accepts. Automaton has 19677 states and 29113 transitions. Word has length 95 [2022-11-02 20:33:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:26,399 INFO L495 AbstractCegarLoop]: Abstraction has 19677 states and 29113 transitions. [2022-11-02 20:33:26,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-11-02 20:33:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 19677 states and 29113 transitions. [2022-11-02 20:33:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-02 20:33:26,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:26,405 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:26,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:33:26,406 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:26,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1190376870, now seen corresponding path program 1 times [2022-11-02 20:33:26,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:26,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131452115] [2022-11-02 20:33:26,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:26,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:26,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:26,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131452115] [2022-11-02 20:33:26,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131452115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:26,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:26,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:33:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682842847] [2022-11-02 20:33:26,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:26,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:33:26,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:26,540 INFO L87 Difference]: Start difference. First operand 19677 states and 29113 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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-11-02 20:33:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:33,117 INFO L93 Difference]: Finished difference Result 22685 states and 34737 transitions. [2022-11-02 20:33:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:33,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-11-02 20:33:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:33,148 INFO L225 Difference]: With dead ends: 22685 [2022-11-02 20:33:33,148 INFO L226 Difference]: Without dead ends: 21181 [2022-11-02 20:33:33,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-02 20:33:33,157 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 1084 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:33,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 521 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-02 20:33:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21181 states. [2022-11-02 20:33:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21181 to 21179. [2022-11-02 20:33:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21179 states, 21177 states have (on average 1.4766019738395428) internal successors, (31270), 21178 states have internal predecessors, (31270), 0 states have call successors, (0), 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-11-02 20:33:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21179 states to 21179 states and 31270 transitions. [2022-11-02 20:33:35,566 INFO L78 Accepts]: Start accepts. Automaton has 21179 states and 31270 transitions. Word has length 121 [2022-11-02 20:33:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:35,566 INFO L495 AbstractCegarLoop]: Abstraction has 21179 states and 31270 transitions. [2022-11-02 20:33:35,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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-11-02 20:33:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 21179 states and 31270 transitions. [2022-11-02 20:33:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-02 20:33:35,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:35,581 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:35,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:33:35,581 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:35,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1202553482, now seen corresponding path program 1 times [2022-11-02 20:33:35,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:35,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402819699] [2022-11-02 20:33:35,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:33:35,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:35,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402819699] [2022-11-02 20:33:35,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402819699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:35,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:35,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:33:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161486535] [2022-11-02 20:33:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:35,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:33:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:33:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:33:35,902 INFO L87 Difference]: Start difference. First operand 21179 states and 31270 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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-11-02 20:33:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:49,029 INFO L93 Difference]: Finished difference Result 151499 states and 219886 transitions. [2022-11-02 20:33:49,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:33:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 130 [2022-11-02 20:33:49,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:49,221 INFO L225 Difference]: With dead ends: 151499 [2022-11-02 20:33:49,222 INFO L226 Difference]: Without dead ends: 133385 [2022-11-02 20:33:49,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:33:49,261 INFO L413 NwaCegarLoop]: 1708 mSDtfsCounter, 10875 mSDsluCounter, 2449 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10875 SdHoareTripleChecker+Valid, 4157 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:49,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10875 Valid, 4157 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133385 states. [2022-11-02 20:33:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133385 to 39291. [2022-11-02 20:33:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39291 states, 39289 states have (on average 1.4588816208098958) internal successors, (57318), 39290 states have internal predecessors, (57318), 0 states have call successors, (0), 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-11-02 20:33:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39291 states to 39291 states and 57318 transitions. [2022-11-02 20:33:54,742 INFO L78 Accepts]: Start accepts. Automaton has 39291 states and 57318 transitions. Word has length 130 [2022-11-02 20:33:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:54,743 INFO L495 AbstractCegarLoop]: Abstraction has 39291 states and 57318 transitions. [2022-11-02 20:33:54,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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-11-02 20:33:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 39291 states and 57318 transitions. [2022-11-02 20:33:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-02 20:33:54,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:54,758 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:33:54,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:33:54,758 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:54,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash -566229334, now seen corresponding path program 1 times [2022-11-02 20:33:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:54,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209362559] [2022-11-02 20:33:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:33:55,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:55,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209362559] [2022-11-02 20:33:55,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209362559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:55,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:55,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:33:55,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994566121] [2022-11-02 20:33:55,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:55,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:33:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:55,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:33:55,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:33:55,098 INFO L87 Difference]: Start difference. First operand 39291 states and 57318 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)