./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/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_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/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 64bit --witnessprinter.graph.data.programhash a900a56caf1252bf2b77371f0836914c913e44b231203ecd4eebd687a96fd0c2 --- 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:16:54,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:16:54,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:16:54,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:16:54,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:16:54,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:16:54,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:16:54,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:16:54,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:16:54,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:16:54,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:16:54,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:16:54,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:16:54,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:16:54,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:16:54,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:16:54,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:16:54,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:16:54,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:16:54,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:16:54,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:16:54,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:16:54,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:16:54,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:16:54,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:16:54,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:16:54,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:16:54,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:16:54,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:16:54,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:16:54,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:16:54,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:16:54,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:16:54,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:16:54,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:16:54,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:16:54,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:16:54,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:16:54,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:16:54,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:16:54,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:16:54,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:16:54,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:16:54,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:16:54,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:16:54,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:16:54,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:16:54,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:16:54,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:16:54,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:16:54,177 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:16:54,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:16:54,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:16:54,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:16:54,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:16:54,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:16:54,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:16:54,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:16:54,178 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:16:54,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:16:54,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:16:54,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:16:54,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:16:54,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:16:54,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:16:54,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:16:54,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:16:54,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:16:54,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:16:54,180 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:16:54,181 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:16:54,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:16:54,181 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_8982a40b-ea61-4eb1-9ead-1b21b92c2536/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_8982a40b-ea61-4eb1-9ead-1b21b92c2536/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a900a56caf1252bf2b77371f0836914c913e44b231203ecd4eebd687a96fd0c2 [2022-11-02 20:16:54,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:16:54,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:16:54,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:16:54,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:16:54,498 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:16:54,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i [2022-11-02 20:16:54,592 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/data/088ad6088/d9c35702d288414f90172ec465c6b950/FLAG8f901cf02 [2022-11-02 20:16:55,557 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:16:55,558 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i [2022-11-02 20:16:55,625 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/data/088ad6088/d9c35702d288414f90172ec465c6b950/FLAG8f901cf02 [2022-11-02 20:16:55,952 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/data/088ad6088/d9c35702d288414f90172ec465c6b950 [2022-11-02 20:16:55,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:16:55,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:16:55,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:16:55,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:16:55,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:16:55,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:16:55" (1/1) ... [2022-11-02 20:16:55,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a8316e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:55, skipping insertion in model container [2022-11-02 20:16:55,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:16:55" (1/1) ... [2022-11-02 20:16:55,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:16:56,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:16:56,825 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [5986] [2022-11-02 20:16:56,830 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [5987-5988] [2022-11-02 20:16:57,507 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_8982a40b-ea61-4eb1-9ead-1b21b92c2536/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i[188410,188423] [2022-11-02 20:16:59,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:16:59,047 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:16:59,218 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [5986] [2022-11-02 20:16:59,219 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [5987-5988] [2022-11-02 20:16:59,248 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_8982a40b-ea61-4eb1-9ead-1b21b92c2536/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i[188410,188423] [2022-11-02 20:16:59,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:16:59,890 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:16:59,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:59 WrapperNode [2022-11-02 20:16:59,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:16:59,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:16:59,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:16:59,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:16:59,899 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:16:59" (1/1) ... [2022-11-02 20:17:00,003 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:16:59" (1/1) ... [2022-11-02 20:17:00,199 INFO L138 Inliner]: procedures = 350, calls = 2000, calls flagged for inlining = 171, calls inlined = 139, statements flattened = 4668 [2022-11-02 20:17:00,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:17:00,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:17:00,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:17:00,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:17:00,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:59" (1/1) ... [2022-11-02 20:17:00,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:59" (1/1) ... [2022-11-02 20:17:00,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:59" (1/1) ... [2022-11-02 20:17:00,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:59" (1/1) ... [2022-11-02 20:17:00,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:59" (1/1) ... [2022-11-02 20:17:00,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:59" (1/1) ... [2022-11-02 20:17:00,441 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:59" (1/1) ... [2022-11-02 20:17:00,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:59" (1/1) ... [2022-11-02 20:17:00,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:17:00,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:17:00,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:17:00,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:17:00,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:59" (1/1) ... [2022-11-02 20:17:00,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:17:00,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:17:00,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:17:00,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:17:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:17:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure get_page [2022-11-02 20:17:00,610 INFO L138 BoogieDeclarations]: Found implementation of procedure get_page [2022-11-02 20:17:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:17:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_release_tx_bufs [2022-11-02 20:17:00,610 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_release_tx_bufs [2022-11-02 20:17:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:17:00,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:17:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head_init [2022-11-02 20:17:00,611 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head_init [2022-11-02 20:17:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure napi_schedule [2022-11-02 20:17:00,612 INFO L138 BoogieDeclarations]: Found implementation of procedure napi_schedule [2022-11-02 20:17:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_change_mtu [2022-11-02 20:17:00,612 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_change_mtu [2022-11-02 20:17:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-11-02 20:17:00,612 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-11-02 20:17:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_write [2022-11-02 20:17:00,613 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_write [2022-11-02 20:17:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-11-02 20:17:00,613 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-11-02 20:17:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-11-02 20:17:00,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-11-02 20:17:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:17:00,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:17:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-11-02 20:17:00,614 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-11-02 20:17:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure u64_stats_update_begin [2022-11-02 20:17:00,615 INFO L138 BoogieDeclarations]: Found implementation of procedure u64_stats_update_begin [2022-11-02 20:17:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure bind_evtchn_to_irqhandler [2022-11-02 20:17:00,615 INFO L138 BoogieDeclarations]: Found implementation of procedure bind_evtchn_to_irqhandler [2022-11-02 20:17:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_transaction_end [2022-11-02 20:17:00,615 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_transaction_end [2022-11-02 20:17:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_remove [2022-11-02 20:17:00,616 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_remove [2022-11-02 20:17:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:17:00,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:17:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-11-02 20:17:00,617 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-11-02 20:17:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-02 20:17:00,617 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-02 20:17:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_grant_ring [2022-11-02 20:17:00,618 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_grant_ring [2022-11-02 20:17:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-11-02 20:17:00,618 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-11-02 20:17:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:17:00,619 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:17:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_claim_grant_reference [2022-11-02 20:17:00,619 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_claim_grant_reference [2022-11-02 20:17:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:17:00,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:17:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure netif_set_real_num_tx_queues [2022-11-02 20:17:00,620 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_set_real_num_tx_queues [2022-11-02 20:17:00,621 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_end_foreign_access [2022-11-02 20:17:00,622 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_end_foreign_access [2022-11-02 20:17:00,622 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_disconnect_backend [2022-11-02 20:17:00,622 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_disconnect_backend [2022-11-02 20:17:00,622 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_get_stats64 [2022-11-02 20:17:00,623 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_get_stats64 [2022-11-02 20:17:00,623 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-02 20:17:00,623 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-02 20:17:00,623 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_alloc_evtchn [2022-11-02 20:17:00,623 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_alloc_evtchn [2022-11-02 20:17:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-11-02 20:17:00,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-11-02 20:17:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_alloc_grant_references [2022-11-02 20:17:00,625 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_alloc_grant_references [2022-11-02 20:17:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:17:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure netfront_tx_slot_available [2022-11-02 20:17:00,626 INFO L138 BoogieDeclarations]: Found implementation of procedure netfront_tx_slot_available [2022-11-02 20:17:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure notify_remote_via_irq [2022-11-02 20:17:00,626 INFO L138 BoogieDeclarations]: Found implementation of procedure notify_remote_via_irq [2022-11-02 20:17:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_release_grant_reference [2022-11-02 20:17:00,627 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_release_grant_reference [2022-11-02 20:17:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure eth_mac_addr [2022-11-02 20:17:00,627 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_mac_addr [2022-11-02 20:17:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_can_sg [2022-11-02 20:17:00,627 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_can_sg [2022-11-02 20:17:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:17:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-11-02 20:17:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-11-02 20:17:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-11-02 20:17:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-11-02 20:17:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-11-02 20:17:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-11-02 20:17:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u32 [2022-11-02 20:17:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_queue_tail [2022-11-02 20:17:00,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_queue_tail [2022-11-02 20:17:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_rxidx [2022-11-02 20:17:00,630 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_rxidx [2022-11-02 20:17:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-02 20:17:00,630 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-02 20:17:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:17:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-11-02 20:17:00,631 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-11-02 20:17:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:17:00,632 INFO L130 BoogieDeclarations]: Found specification of procedure write_queue_xenstore_keys [2022-11-02 20:17:00,632 INFO L138 BoogieDeclarations]: Found implementation of procedure write_queue_xenstore_keys [2022-11-02 20:17:00,632 INFO L130 BoogieDeclarations]: Found specification of procedure pfn_to_mfn [2022-11-02 20:17:00,632 INFO L138 BoogieDeclarations]: Found implementation of procedure pfn_to_mfn [2022-11-02 20:17:00,632 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2022-11-02 20:17:00,632 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2022-11-02 20:17:00,633 INFO L130 BoogieDeclarations]: Found specification of procedure add_id_to_freelist [2022-11-02 20:17:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure add_id_to_freelist [2022-11-02 20:17:00,633 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_alloc_rx_buffers [2022-11-02 20:17:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_alloc_rx_buffers [2022-11-02 20:17:00,633 INFO L130 BoogieDeclarations]: Found specification of procedure skb_entry_set_link [2022-11-02 20:17:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_entry_set_link [2022-11-02 20:17:00,634 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-02 20:17:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-02 20:17:00,634 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-02 20:17:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-02 20:17:00,634 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-11-02 20:17:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-11-02 20:17:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure free_pages [2022-11-02 20:17:00,636 INFO L138 BoogieDeclarations]: Found implementation of procedure free_pages [2022-11-02 20:17:00,639 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_end_foreign_access_ref [2022-11-02 20:17:00,639 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_end_foreign_access_ref [2022-11-02 20:17:00,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:17:00,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 20:17:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 20:17:00,642 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-11-02 20:17:00,642 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-11-02 20:17:00,642 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_free_grant_references [2022-11-02 20:17:00,643 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_free_grant_references [2022-11-02 20:17:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure simple_strtoul [2022-11-02 20:17:00,649 INFO L138 BoogieDeclarations]: Found implementation of procedure simple_strtoul [2022-11-02 20:17:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-11-02 20:17:00,649 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-11-02 20:17:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-02 20:17:00,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-02 20:17:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:17:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure unbind_from_irqhandler [2022-11-02 20:17:00,650 INFO L138 BoogieDeclarations]: Found implementation of procedure unbind_from_irqhandler [2022-11-02 20:17:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure get_zeroed_page [2022-11-02 20:17:00,650 INFO L138 BoogieDeclarations]: Found implementation of procedure get_zeroed_page [2022-11-02 20:17:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure netback_changed [2022-11-02 20:17:00,650 INFO L138 BoogieDeclarations]: Found implementation of procedure netback_changed [2022-11-02 20:17:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_poll_controller [2022-11-02 20:17:00,651 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_poll_controller [2022-11-02 20:17:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_insert [2022-11-02 20:17:00,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_insert [2022-11-02 20:17:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:17:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-02 20:17:00,651 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-02 20:17:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-11-02 20:17:00,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-11-02 20:17:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure skb_frag_page [2022-11-02 20:17:00,652 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_frag_page [2022-11-02 20:17:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:17:00,652 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:17:00,652 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_select_queue [2022-11-02 20:17:00,652 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_select_queue [2022-11-02 20:17:00,653 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_end_access [2022-11-02 20:17:00,653 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_end_access [2022-11-02 20:17:00,653 INFO L130 BoogieDeclarations]: Found specification of procedure skb_get [2022-11-02 20:17:00,653 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_get [2022-11-02 20:17:00,653 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-02 20:17:00,653 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-02 20:17:00,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-11-02 20:17:00,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-11-02 20:17:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_get_rx_ref [2022-11-02 20:17:00,654 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_get_rx_ref [2022-11-02 20:17:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:17:00,654 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:17:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure __netdev_alloc_skb [2022-11-02 20:17:00,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __netdev_alloc_skb [2022-11-02 20:17:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure skb_add_rx_frag [2022-11-02 20:17:00,655 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_add_rx_frag [2022-11-02 20:17:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:17:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure net_ratelimit [2022-11-02 20:17:00,655 INFO L138 BoogieDeclarations]: Found implementation of procedure net_ratelimit [2022-11-02 20:17:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-11-02 20:17:00,655 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-11-02 20:17:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:17:00,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:17:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure get_id_from_freelist [2022-11-02 20:17:00,656 INFO L138 BoogieDeclarations]: Found implementation of procedure get_id_from_freelist [2022-11-02 20:17:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_dequeue [2022-11-02 20:17:00,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_dequeue [2022-11-02 20:17:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_fix_features [2022-11-02 20:17:00,657 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_fix_features [2022-11-02 20:17:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:17:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-11-02 20:17:00,657 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-11-02 20:17:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:17:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-11-02 20:17:00,718 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-11-02 20:17:00,718 INFO L130 BoogieDeclarations]: Found specification of procedure cpumask_next [2022-11-02 20:17:00,718 INFO L138 BoogieDeclarations]: Found implementation of procedure cpumask_next [2022-11-02 20:17:00,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:17:00,718 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-11-02 20:17:00,718 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-11-02 20:17:00,718 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headlen [2022-11-02 20:17:00,718 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headlen [2022-11-02 20:17:00,718 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-11-02 20:17:00,718 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-11-02 20:17:00,718 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_stop_queue [2022-11-02 20:17:00,719 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_stop_queue [2022-11-02 20:17:00,719 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_lock [2022-11-02 20:17:00,719 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_lock [2022-11-02 20:17:00,719 INFO L130 BoogieDeclarations]: Found specification of procedure skb_is_gso [2022-11-02 20:17:00,719 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_is_gso [2022-11-02 20:17:00,719 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-11-02 20:17:00,719 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-11-02 20:17:00,719 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_len [2022-11-02 20:17:00,719 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_len [2022-11-02 20:17:00,719 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_grant_foreign_access_ref [2022-11-02 20:17:00,719 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_grant_foreign_access_ref [2022-11-02 20:17:00,719 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-02 20:17:00,719 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-02 20:17:00,720 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_set_features [2022-11-02 20:17:00,720 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_set_features [2022-11-02 20:17:00,720 INFO L130 BoogieDeclarations]: Found specification of procedure skb_frag_size [2022-11-02 20:17:00,720 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_frag_size [2022-11-02 20:17:00,720 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-11-02 20:17:00,720 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-11-02 20:17:00,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:17:00,720 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-11-02 20:17:00,720 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-11-02 20:17:00,720 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-11-02 20:17:00,720 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-11-02 20:17:00,720 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_free_evtchn [2022-11-02 20:17:00,720 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_free_evtchn [2022-11-02 20:17:00,720 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_get_rx_skb [2022-11-02 20:17:00,721 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_get_rx_skb [2022-11-02 20:17:00,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:17:00,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:17:00,721 INFO L130 BoogieDeclarations]: Found specification of procedure xennet_tx_buf_gc [2022-11-02 20:17:00,721 INFO L138 BoogieDeclarations]: Found implementation of procedure xennet_tx_buf_gc [2022-11-02 20:17:00,721 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-11-02 20:17:00,721 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-11-02 20:17:00,721 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-02 20:17:00,721 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-02 20:17:01,659 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:17:01,669 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:17:02,936 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:17:10,289 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:17:10,308 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:17:10,309 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:17:10,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:17:10 BoogieIcfgContainer [2022-11-02 20:17:10,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:17:10,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:17:10,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:17:10,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:17:10,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:16:55" (1/3) ... [2022-11-02 20:17:10,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8c95ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:17:10, skipping insertion in model container [2022-11-02 20:17:10,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:59" (2/3) ... [2022-11-02 20:17:10,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8c95ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:17:10, skipping insertion in model container [2022-11-02 20:17:10,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:17:10" (3/3) ... [2022-11-02 20:17:10,327 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--net--xen-netfront.ko-entry_point.cil.out.i [2022-11-02 20:17:10,349 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:17:10,350 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:17:10,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:17:10,503 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;@3c4b648e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:17:10,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:17:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 1587 states, 1111 states have (on average 1.297029702970297) internal successors, (1441), 1141 states have internal predecessors, (1441), 367 states have call successors, (367), 108 states have call predecessors, (367), 107 states have return successors, (362), 360 states have call predecessors, (362), 362 states have call successors, (362) [2022-11-02 20:17:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-02 20:17:10,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:10,562 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:10,563 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1077420318, now seen corresponding path program 1 times [2022-11-02 20:17:10,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:10,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960035403] [2022-11-02 20:17:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:17:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:17:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:17:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:17:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:17:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:17:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:17:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:17:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:17:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:17:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:17:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:17:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:17:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:17:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:17:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:17:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:17:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:17:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:17:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:17:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-02 20:17:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:17:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:17:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-02 20:17:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-11-02 20:17:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:11,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960035403] [2022-11-02 20:17:11,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960035403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:11,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:11,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:17:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281364394] [2022-11-02 20:17:11,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:11,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:11,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:11,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:11,999 INFO L87 Difference]: Start difference. First operand has 1587 states, 1111 states have (on average 1.297029702970297) internal successors, (1441), 1141 states have internal predecessors, (1441), 367 states have call successors, (367), 108 states have call predecessors, (367), 107 states have return successors, (362), 360 states have call predecessors, (362), 362 states have call successors, (362) Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 20:17:21,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:25,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:27,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:30,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:32,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:34,405 INFO L93 Difference]: Finished difference Result 4573 states and 6357 transitions. [2022-11-02 20:17:34,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:17:34,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2022-11-02 20:17:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:34,465 INFO L225 Difference]: With dead ends: 4573 [2022-11-02 20:17:34,466 INFO L226 Difference]: Without dead ends: 2943 [2022-11-02 20:17:34,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:17:34,489 INFO L413 NwaCegarLoop]: 2148 mSDtfsCounter, 3983 mSDsluCounter, 3118 mSDsCounter, 0 mSdLazyCounter, 3975 mSolverCounterSat, 2801 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4209 SdHoareTripleChecker+Valid, 5266 SdHoareTripleChecker+Invalid, 6780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2801 IncrementalHoareTripleChecker+Valid, 3975 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:34,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4209 Valid, 5266 Invalid, 6780 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2801 Valid, 3975 Invalid, 4 Unknown, 0 Unchecked, 21.5s Time] [2022-11-02 20:17:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2022-11-02 20:17:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2569. [2022-11-02 20:17:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 1803 states have (on average 1.2784248474764282) internal successors, (2305), 1846 states have internal predecessors, (2305), 572 states have call successors, (572), 193 states have call predecessors, (572), 193 states have return successors, (576), 562 states have call predecessors, (576), 571 states have call successors, (576) [2022-11-02 20:17:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3453 transitions. [2022-11-02 20:17:34,890 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3453 transitions. Word has length 162 [2022-11-02 20:17:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:34,893 INFO L495 AbstractCegarLoop]: Abstraction has 2569 states and 3453 transitions. [2022-11-02 20:17:34,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 20:17:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3453 transitions. [2022-11-02 20:17:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-02 20:17:34,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:34,914 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:34,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:17:34,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:34,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1609982772, now seen corresponding path program 1 times [2022-11-02 20:17:34,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:34,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328396033] [2022-11-02 20:17:34,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:34,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:17:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:17:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:17:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:17:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:17:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:17:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:17:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:17:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:17:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:17:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:17:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:17:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:17:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:17:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:17:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:17:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:17:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:17:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-02 20:17:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-11-02 20:17:35,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:35,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328396033] [2022-11-02 20:17:35,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328396033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:35,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:35,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:17:35,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947976068] [2022-11-02 20:17:35,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:35,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:35,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:35,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:35,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:35,588 INFO L87 Difference]: Start difference. First operand 2569 states and 3453 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:17:44,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:47,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:50,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:52,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:55,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:57,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:59,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:01,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:03,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:05,436 INFO L93 Difference]: Finished difference Result 6794 states and 9260 transitions. [2022-11-02 20:18:05,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:18:05,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2022-11-02 20:18:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:05,464 INFO L225 Difference]: With dead ends: 6794 [2022-11-02 20:18:05,464 INFO L226 Difference]: Without dead ends: 4252 [2022-11-02 20:18:05,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:18:05,474 INFO L413 NwaCegarLoop]: 2922 mSDtfsCounter, 2425 mSDsluCounter, 4654 mSDsCounter, 0 mSdLazyCounter, 3967 mSolverCounterSat, 1444 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2668 SdHoareTripleChecker+Valid, 7576 SdHoareTripleChecker+Invalid, 5419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1444 IncrementalHoareTripleChecker+Valid, 3967 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:05,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2668 Valid, 7576 Invalid, 5419 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1444 Valid, 3967 Invalid, 8 Unknown, 0 Unchecked, 29.2s Time] [2022-11-02 20:18:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2022-11-02 20:18:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 3705. [2022-11-02 20:18:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3705 states, 2615 states have (on average 1.2822179732313574) internal successors, (3353), 2674 states have internal predecessors, (3353), 814 states have call successors, (814), 273 states have call predecessors, (814), 275 states have return successors, (833), 804 states have call predecessors, (833), 813 states have call successors, (833) [2022-11-02 20:18:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 5000 transitions. [2022-11-02 20:18:05,693 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 5000 transitions. Word has length 155 [2022-11-02 20:18:05,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:05,694 INFO L495 AbstractCegarLoop]: Abstraction has 3705 states and 5000 transitions. [2022-11-02 20:18:05,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:18:05,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 5000 transitions. [2022-11-02 20:18:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-11-02 20:18:05,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:05,703 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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:18:05,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:18:05,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:05,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash 356772008, now seen corresponding path program 1 times [2022-11-02 20:18:05,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:05,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239239377] [2022-11-02 20:18:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:18:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:18:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:18:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:18:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:18:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:18:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:18:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:18:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:18:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:18:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:18:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:18:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:18:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:18:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:18:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-02 20:18:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:18:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-02 20:18:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:18:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:18:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-02 20:18:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-02 20:18:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:06,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239239377] [2022-11-02 20:18:06,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239239377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:06,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:06,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:18:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226660540] [2022-11-02 20:18:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:06,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:18:06,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:06,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:18:06,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:06,443 INFO L87 Difference]: Start difference. First operand 3705 states and 5000 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:18:13,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:16,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:19,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:20,468 INFO L93 Difference]: Finished difference Result 7910 states and 10785 transitions. [2022-11-02 20:18:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:18:20,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 180 [2022-11-02 20:18:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:20,491 INFO L225 Difference]: With dead ends: 7910 [2022-11-02 20:18:20,492 INFO L226 Difference]: Without dead ends: 4249 [2022-11-02 20:18:20,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:18:20,504 INFO L413 NwaCegarLoop]: 1979 mSDtfsCounter, 1445 mSDsluCounter, 4228 mSDsCounter, 0 mSdLazyCounter, 3362 mSolverCounterSat, 1399 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 6207 SdHoareTripleChecker+Invalid, 4764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1399 IncrementalHoareTripleChecker+Valid, 3362 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:20,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 6207 Invalid, 4764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1399 Valid, 3362 Invalid, 3 Unknown, 0 Unchecked, 13.6s Time] [2022-11-02 20:18:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4249 states. [2022-11-02 20:18:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4249 to 3705. [2022-11-02 20:18:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3705 states, 2615 states have (on average 1.2791586998087954) internal successors, (3345), 2674 states have internal predecessors, (3345), 814 states have call successors, (814), 273 states have call predecessors, (814), 275 states have return successors, (833), 804 states have call predecessors, (833), 813 states have call successors, (833) [2022-11-02 20:18:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 4992 transitions. [2022-11-02 20:18:20,704 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 4992 transitions. Word has length 180 [2022-11-02 20:18:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:20,704 INFO L495 AbstractCegarLoop]: Abstraction has 3705 states and 4992 transitions. [2022-11-02 20:18:20,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:18:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 4992 transitions. [2022-11-02 20:18:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:18:20,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:20,710 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:20,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:18:20,711 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:20,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash -562291296, now seen corresponding path program 1 times [2022-11-02 20:18:20,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:20,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944710066] [2022-11-02 20:18:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:20,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:18:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:18:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:18:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:18:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:18:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:18:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:18:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:18:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:18:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:18:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:18:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:18:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:18:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:18:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:18:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:18:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-02 20:18:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 20:18:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-02 20:18:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:18:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-02 20:18:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-02 20:18:21,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:21,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944710066] [2022-11-02 20:18:21,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944710066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:21,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:21,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:18:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002987521] [2022-11-02 20:18:21,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:21,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:18:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:21,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:18:21,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:18:21,287 INFO L87 Difference]: Start difference. First operand 3705 states and 4992 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-02 20:18:28,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:32,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:34,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:36,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:38,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:40,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:43,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:44,902 INFO L93 Difference]: Finished difference Result 10589 states and 14438 transitions. [2022-11-02 20:18:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:18:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 189 [2022-11-02 20:18:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:44,938 INFO L225 Difference]: With dead ends: 10589 [2022-11-02 20:18:44,938 INFO L226 Difference]: Without dead ends: 6936 [2022-11-02 20:18:44,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:18:44,952 INFO L413 NwaCegarLoop]: 2568 mSDtfsCounter, 4130 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 2739 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4469 SdHoareTripleChecker+Valid, 5805 SdHoareTripleChecker+Invalid, 6046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2739 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:44,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4469 Valid, 5805 Invalid, 6046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2739 Valid, 3301 Invalid, 6 Unknown, 0 Unchecked, 23.0s Time] [2022-11-02 20:18:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2022-11-02 20:18:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 5942. [2022-11-02 20:18:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5942 states, 4198 states have (on average 1.2779895188184849) internal successors, (5365), 4289 states have internal predecessors, (5365), 1292 states have call successors, (1292), 449 states have call predecessors, (1292), 451 states have return successors, (1312), 1281 states have call predecessors, (1312), 1291 states have call successors, (1312) [2022-11-02 20:18:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5942 states to 5942 states and 7969 transitions. [2022-11-02 20:18:45,370 INFO L78 Accepts]: Start accepts. Automaton has 5942 states and 7969 transitions. Word has length 189 [2022-11-02 20:18:45,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:45,372 INFO L495 AbstractCegarLoop]: Abstraction has 5942 states and 7969 transitions. [2022-11-02 20:18:45,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-02 20:18:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 5942 states and 7969 transitions. [2022-11-02 20:18:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-02 20:18:45,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:45,380 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:45,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:18:45,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:45,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1421263068, now seen corresponding path program 1 times [2022-11-02 20:18:45,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:45,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490806503] [2022-11-02 20:18:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:45,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:45,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:18:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:18:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:45,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:18:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:45,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:18:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:45,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:18:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:45,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:18:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:45,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:18:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:45,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:18:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:18:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:18:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:18:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:18:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:18:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:18:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:18:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:18:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-02 20:18:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:18:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:18:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:18:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:18:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-11-02 20:18:46,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:46,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490806503] [2022-11-02 20:18:46,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490806503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:46,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:46,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:18:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307522009] [2022-11-02 20:18:46,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:46,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:18:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:46,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:18:46,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:18:46,168 INFO L87 Difference]: Start difference. First operand 5942 states and 7969 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:18:54,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:57,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:18:59,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:02,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:04,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:06,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:08,365 INFO L93 Difference]: Finished difference Result 12149 states and 16633 transitions. [2022-11-02 20:19:08,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:19:08,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 187 [2022-11-02 20:19:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:08,442 INFO L225 Difference]: With dead ends: 12149 [2022-11-02 20:19:08,442 INFO L226 Difference]: Without dead ends: 12146 [2022-11-02 20:19:08,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:19:08,450 INFO L413 NwaCegarLoop]: 2318 mSDtfsCounter, 3146 mSDsluCounter, 3818 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 1887 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3385 SdHoareTripleChecker+Valid, 6136 SdHoareTripleChecker+Invalid, 5604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1887 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:08,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3385 Valid, 6136 Invalid, 5604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1887 Valid, 3711 Invalid, 6 Unknown, 0 Unchecked, 21.4s Time] [2022-11-02 20:19:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12146 states. [2022-11-02 20:19:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12146 to 10342. [2022-11-02 20:19:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10342 states, 7410 states have (on average 1.2893387314439946) internal successors, (9554), 7577 states have internal predecessors, (9554), 2119 states have call successors, (2119), 804 states have call predecessors, (2119), 812 states have return successors, (2193), 2090 states have call predecessors, (2193), 2118 states have call successors, (2193) [2022-11-02 20:19:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10342 states to 10342 states and 13866 transitions. [2022-11-02 20:19:09,149 INFO L78 Accepts]: Start accepts. Automaton has 10342 states and 13866 transitions. Word has length 187 [2022-11-02 20:19:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:09,150 INFO L495 AbstractCegarLoop]: Abstraction has 10342 states and 13866 transitions. [2022-11-02 20:19:09,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:19:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 10342 states and 13866 transitions. [2022-11-02 20:19:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-11-02 20:19:09,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:09,168 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:09,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:19:09,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1367939842, now seen corresponding path program 1 times [2022-11-02 20:19:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:09,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549130558] [2022-11-02 20:19:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:09,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:19:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:19:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:19:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:19:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:19:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:19:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:19:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:19:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:19:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:19:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:19:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:19:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:19:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:19:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:19:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:19:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:19:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:19:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:19:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 20:19:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-02 20:19:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-02 20:19:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-02 20:19:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-02 20:19:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 20:19:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 20:19:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-02 20:19:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-11-02 20:19:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-02 20:19:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2022-11-02 20:19:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:09,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549130558] [2022-11-02 20:19:09,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549130558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:09,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:09,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:19:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97830687] [2022-11-02 20:19:09,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:09,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:19:09,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:09,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:19:09,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:19:09,975 INFO L87 Difference]: Start difference. First operand 10342 states and 13866 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-11-02 20:19:21,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:24,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:28,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:31,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:33,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:35,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:38,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:40,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:19:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:42,483 INFO L93 Difference]: Finished difference Result 30578 states and 42212 transitions. [2022-11-02 20:19:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:19:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 254 [2022-11-02 20:19:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:42,569 INFO L225 Difference]: With dead ends: 30578 [2022-11-02 20:19:42,569 INFO L226 Difference]: Without dead ends: 20288 [2022-11-02 20:19:42,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:19:42,600 INFO L413 NwaCegarLoop]: 2207 mSDtfsCounter, 7159 mSDsluCounter, 4882 mSDsCounter, 0 mSdLazyCounter, 6446 mSolverCounterSat, 5064 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7506 SdHoareTripleChecker+Valid, 7089 SdHoareTripleChecker+Invalid, 11517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5064 IncrementalHoareTripleChecker+Valid, 6446 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:42,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7506 Valid, 7089 Invalid, 11517 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5064 Valid, 6446 Invalid, 7 Unknown, 0 Unchecked, 30.9s Time] [2022-11-02 20:19:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20288 states. [2022-11-02 20:19:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20288 to 10481. [2022-11-02 20:19:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10481 states, 7518 states have (on average 1.2877094972067038) internal successors, (9681), 7686 states have internal predecessors, (9681), 2134 states have call successors, (2134), 814 states have call predecessors, (2134), 828 states have return successors, (2210), 2109 states have call predecessors, (2210), 2133 states have call successors, (2210) [2022-11-02 20:19:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10481 states to 10481 states and 14025 transitions. [2022-11-02 20:19:43,375 INFO L78 Accepts]: Start accepts. Automaton has 10481 states and 14025 transitions. Word has length 254 [2022-11-02 20:19:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:43,376 INFO L495 AbstractCegarLoop]: Abstraction has 10481 states and 14025 transitions. [2022-11-02 20:19:43,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-11-02 20:19:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 10481 states and 14025 transitions. [2022-11-02 20:19:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-11-02 20:19:43,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:43,394 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:43,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:19:43,394 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:43,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:43,395 INFO L85 PathProgramCache]: Analyzing trace with hash -373246144, now seen corresponding path program 1 times [2022-11-02 20:19:43,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:43,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437381473] [2022-11-02 20:19:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:19:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:19:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:19:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:19:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:19:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:19:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:19:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:19:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:19:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:19:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:19:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:19:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:19:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:19:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:19:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:19:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:19:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:19:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:19:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 20:19:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-02 20:19:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-02 20:19:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-02 20:19:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-02 20:19:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 20:19:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 20:19:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-02 20:19:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-11-02 20:19:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-02 20:19:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2022-11-02 20:19:44,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:44,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437381473] [2022-11-02 20:19:44,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437381473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:44,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080699417] [2022-11-02 20:19:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:44,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:44,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:44,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:44,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:19:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:45,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 2911 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:19:45,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-11-02 20:19:45,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:19:45,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080699417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:45,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:19:45,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-02 20:19:45,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746974063] [2022-11-02 20:19:45,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:45,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:45,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:45,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:45,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:45,854 INFO L87 Difference]: Start difference. First operand 10481 states and 14025 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2022-11-02 20:19:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:46,928 INFO L93 Difference]: Finished difference Result 25602 states and 34263 transitions. [2022-11-02 20:19:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:46,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 254 [2022-11-02 20:19:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:46,986 INFO L225 Difference]: With dead ends: 25602 [2022-11-02 20:19:46,986 INFO L226 Difference]: Without dead ends: 15173 [2022-11-02 20:19:47,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:47,018 INFO L413 NwaCegarLoop]: 2398 mSDtfsCounter, 1559 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:47,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 4312 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15173 states. [2022-11-02 20:19:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15173 to 15121. [2022-11-02 20:19:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15121 states, 10972 states have (on average 1.291195771053591) internal successors, (14167), 11210 states have internal predecessors, (14167), 2928 states have call successors, (2928), 1198 states have call predecessors, (2928), 1220 states have return successors, (3032), 2889 states have call predecessors, (3032), 2927 states have call successors, (3032) [2022-11-02 20:19:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15121 states to 15121 states and 20127 transitions. [2022-11-02 20:19:47,930 INFO L78 Accepts]: Start accepts. Automaton has 15121 states and 20127 transitions. Word has length 254 [2022-11-02 20:19:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:47,931 INFO L495 AbstractCegarLoop]: Abstraction has 15121 states and 20127 transitions. [2022-11-02 20:19:47,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2022-11-02 20:19:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 15121 states and 20127 transitions. [2022-11-02 20:19:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-11-02 20:19:48,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:48,128 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:48,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:19:48,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:48,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1703097001, now seen corresponding path program 1 times [2022-11-02 20:19:48,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:48,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079533283] [2022-11-02 20:19:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:19:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:19:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:19:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:19:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:19:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:19:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:19:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:19:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:19:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:19:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:19:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:19:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:19:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:19:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:19:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:19:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:19:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:19:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:19:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 20:19:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-02 20:19:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-02 20:19:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-11-02 20:19:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-02 20:19:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-02 20:19:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-02 20:19:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-11-02 20:19:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:19:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-11-02 20:19:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-02 20:19:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-11-02 20:19:49,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:49,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079533283] [2022-11-02 20:19:49,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079533283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:49,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:49,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:49,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765989210] [2022-11-02 20:19:49,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:49,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:49,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:49,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:49,241 INFO L87 Difference]: Start difference. First operand 15121 states and 20127 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-11-02 20:19:57,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:20:00,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:20:02,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:20:05,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:20:07,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:20:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:08,595 INFO L93 Difference]: Finished difference Result 32979 states and 44483 transitions. [2022-11-02 20:20:08,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 273 [2022-11-02 20:20:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:08,735 INFO L225 Difference]: With dead ends: 32979 [2022-11-02 20:20:08,735 INFO L226 Difference]: Without dead ends: 17910 [2022-11-02 20:20:08,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:20:08,768 INFO L413 NwaCegarLoop]: 1887 mSDtfsCounter, 2336 mSDsluCounter, 3174 mSDsCounter, 0 mSdLazyCounter, 3237 mSolverCounterSat, 2065 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2467 SdHoareTripleChecker+Valid, 5061 SdHoareTripleChecker+Invalid, 5307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2065 IncrementalHoareTripleChecker+Valid, 3237 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:08,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2467 Valid, 5061 Invalid, 5307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2065 Valid, 3237 Invalid, 5 Unknown, 0 Unchecked, 17.9s Time] [2022-11-02 20:20:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17910 states. [2022-11-02 20:20:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17910 to 15123. [2022-11-02 20:20:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15123 states, 10974 states have (on average 1.2911427009294696) internal successors, (14169), 11212 states have internal predecessors, (14169), 2928 states have call successors, (2928), 1198 states have call predecessors, (2928), 1220 states have return successors, (3032), 2889 states have call predecessors, (3032), 2927 states have call successors, (3032) [2022-11-02 20:20:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15123 states to 15123 states and 20129 transitions. [2022-11-02 20:20:09,832 INFO L78 Accepts]: Start accepts. Automaton has 15123 states and 20129 transitions. Word has length 273 [2022-11-02 20:20:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:09,832 INFO L495 AbstractCegarLoop]: Abstraction has 15123 states and 20129 transitions. [2022-11-02 20:20:09,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-11-02 20:20:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 15123 states and 20129 transitions. [2022-11-02 20:20:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-11-02 20:20:09,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:09,855 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:09,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:20:09,856 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:09,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash -638950833, now seen corresponding path program 1 times [2022-11-02 20:20:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:09,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112050243] [2022-11-02 20:20:09,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:20:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:20:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:20:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:20:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:20:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:20:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:20:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:20:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:20:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:20:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:20:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:20:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:20:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:20:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:20:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:20:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:20:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:20:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 20:20:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 20:20:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-02 20:20:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-02 20:20:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-02 20:20:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-02 20:20:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-11-02 20:20:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-11-02 20:20:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-02 20:20:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-02 20:20:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-11-02 20:20:10,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:10,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112050243] [2022-11-02 20:20:10,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112050243] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:10,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592634409] [2022-11-02 20:20:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:10,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:10,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:10,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:11,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8982a40b-ea61-4eb1-9ead-1b21b92c2536/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:20:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:12,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 2989 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:20:12,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2022-11-02 20:20:12,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-11-02 20:20:12,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592634409] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:12,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:20:12,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2022-11-02 20:20:12,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672420312] [2022-11-02 20:20:12,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:12,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:20:12,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:12,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:20:12,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:20:12,475 INFO L87 Difference]: Start difference. First operand 15123 states and 20129 transitions. Second operand has 11 states, 11 states have (on average 16.181818181818183) internal successors, (178), 7 states have internal predecessors, (178), 2 states have call successors, (65), 6 states have call predecessors, (65), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2022-11-02 20:20:22,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:20:26,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:20:28,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:20:31,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:20:33,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:20:36,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:20:38,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []