./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a --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 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- 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-b5237d8 [2022-11-21 16:44:07,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:44:07,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:44:07,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:44:07,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:44:07,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:44:07,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:44:07,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:44:07,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:44:07,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:44:07,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:44:07,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:44:07,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:44:07,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:44:07,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:44:07,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:44:07,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:44:07,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:44:07,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:44:07,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:44:07,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:44:07,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:44:07,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:44:07,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:44:07,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:44:07,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:44:07,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:44:07,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:44:07,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:44:07,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:44:07,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:44:07,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:44:07,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:44:07,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:44:07,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:44:07,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:44:07,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:44:07,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:44:07,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:44:07,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:44:07,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:44:07,683 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 16:44:07,711 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:44:07,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:44:07,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:44:07,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:44:07,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:44:07,713 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:44:07,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:44:07,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:44:07,717 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:44:07,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:44:07,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:44:07,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:44:07,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:44:07,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:44:07,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:44:07,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:44:07,720 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:44:07,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:44:07,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:44:07,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:44:07,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:44:07,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:44:07,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:44:07,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:44:07,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:44:07,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:44:07,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:44:07,723 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:44:07,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:44:07,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:44:07,724 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_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/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_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a 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 -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2022-11-21 16:44:07,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:44:08,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:44:08,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:44:08,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:44:08,030 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:44:08,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-11-21 16:44:11,149 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:44:11,689 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:44:11,690 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-11-21 16:44:11,730 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/data/b824b3656/4359a855cbda4f2bbd86b9aef5fc7b20/FLAG7fc430bfa [2022-11-21 16:44:11,750 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/data/b824b3656/4359a855cbda4f2bbd86b9aef5fc7b20 [2022-11-21 16:44:11,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:44:11,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:44:11,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:44:11,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:44:11,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:44:11,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:44:11" (1/1) ... [2022-11-21 16:44:11,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@752fc8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:11, skipping insertion in model container [2022-11-21 16:44:11,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:44:11" (1/1) ... [2022-11-21 16:44:11,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:44:11,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:44:13,200 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2022-11-21 16:44:13,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:44:13,273 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:44:13,542 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2022-11-21 16:44:13,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:44:13,775 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:44:13,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13 WrapperNode [2022-11-21 16:44:13,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:44:13,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:44:13,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:44:13,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:44:13,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (1/1) ... [2022-11-21 16:44:13,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (1/1) ... [2022-11-21 16:44:13,912 INFO L138 Inliner]: procedures = 133, calls = 749, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1391 [2022-11-21 16:44:13,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:44:13,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:44:13,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:44:13,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:44:13,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (1/1) ... [2022-11-21 16:44:13,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (1/1) ... [2022-11-21 16:44:13,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (1/1) ... [2022-11-21 16:44:13,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (1/1) ... [2022-11-21 16:44:13,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (1/1) ... [2022-11-21 16:44:14,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (1/1) ... [2022-11-21 16:44:14,012 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (1/1) ... [2022-11-21 16:44:14,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (1/1) ... [2022-11-21 16:44:14,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:44:14,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:44:14,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:44:14,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:44:14,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (1/1) ... [2022-11-21 16:44:14,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:44:14,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:44:14,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:44:14,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:44:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-11-21 16:44:14,184 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-11-21 16:44:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2022-11-21 16:44:14,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2022-11-21 16:44:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-21 16:44:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-11-21 16:44:14,185 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-11-21 16:44:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-21 16:44:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-21 16:44:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:44:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-21 16:44:14,185 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-21 16:44:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2022-11-21 16:44:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2022-11-21 16:44:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-21 16:44:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-21 16:44:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-21 16:44:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-21 16:44:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2022-11-21 16:44:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2022-11-21 16:44:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2022-11-21 16:44:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2022-11-21 16:44:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-21 16:44:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-21 16:44:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2022-11-21 16:44:14,188 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2022-11-21 16:44:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:44:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-11-21 16:44:14,188 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-11-21 16:44:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-21 16:44:14,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-21 16:44:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-11-21 16:44:14,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-11-21 16:44:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-21 16:44:14,189 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-21 16:44:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2022-11-21 16:44:14,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2022-11-21 16:44:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:44:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2022-11-21 16:44:14,191 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2022-11-21 16:44:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:44:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-11-21 16:44:14,191 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-11-21 16:44:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:44:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:44:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2022-11-21 16:44:14,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2022-11-21 16:44:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-21 16:44:14,192 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-21 16:44:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-11-21 16:44:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-11-21 16:44:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:44:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-11-21 16:44:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-11-21 16:44:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-21 16:44:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-21 16:44:14,194 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2022-11-21 16:44:14,194 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2022-11-21 16:44:14,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-21 16:44:14,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-21 16:44:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:44:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:44:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-21 16:44:14,196 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-21 16:44:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2022-11-21 16:44:14,196 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2022-11-21 16:44:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-21 16:44:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-21 16:44:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2022-11-21 16:44:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2022-11-21 16:44:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-21 16:44:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-21 16:44:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-21 16:44:14,198 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-21 16:44:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-21 16:44:14,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-21 16:44:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-11-21 16:44:14,199 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-11-21 16:44:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:44:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-11-21 16:44:14,199 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-11-21 16:44:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-11-21 16:44:14,199 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-11-21 16:44:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-21 16:44:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:44:14,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:44:14,650 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:44:14,653 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:44:15,098 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-21 16:44:15,372 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-21 16:44:17,823 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-11-21 16:44:17,824 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-11-21 16:44:17,873 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:44:17,898 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:44:17,898 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-11-21 16:44:17,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:44:17 BoogieIcfgContainer [2022-11-21 16:44:17,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:44:17,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:44:17,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:44:17,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:44:17,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:44:11" (1/3) ... [2022-11-21 16:44:17,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc646be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:44:17, skipping insertion in model container [2022-11-21 16:44:17,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:44:13" (2/3) ... [2022-11-21 16:44:17,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc646be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:44:17, skipping insertion in model container [2022-11-21 16:44:17,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:44:17" (3/3) ... [2022-11-21 16:44:17,915 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-11-21 16:44:17,934 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:44:17,934 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:44:18,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:44:18,027 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;@54c57967, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:44:18,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:44:18,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 431 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 316 states have internal predecessors, (411), 91 states have call successors, (91), 35 states have call predecessors, (91), 34 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2022-11-21 16:44:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:44:18,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:18,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:44:18,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:18,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1517292025, now seen corresponding path program 1 times [2022-11-21 16:44:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:18,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586841092] [2022-11-21 16:44:18,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:18,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:18,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:44:18,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:18,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586841092] [2022-11-21 16:44:18,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586841092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:18,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:18,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:44:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669618639] [2022-11-21 16:44:18,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:18,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:44:18,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:18,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:44:18,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:44:18,767 INFO L87 Difference]: Start difference. First operand has 431 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 316 states have internal predecessors, (411), 91 states have call successors, (91), 35 states have call predecessors, (91), 34 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:44:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:19,014 INFO L93 Difference]: Finished difference Result 1253 states and 1768 transitions. [2022-11-21 16:44:19,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:44:19,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-21 16:44:19,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:19,045 INFO L225 Difference]: With dead ends: 1253 [2022-11-21 16:44:19,045 INFO L226 Difference]: Without dead ends: 824 [2022-11-21 16:44:19,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:44:19,059 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 545 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:19,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:44:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-11-21 16:44:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2022-11-21 16:44:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 581 states have (on average 1.2581755593803787) internal successors, (731), 593 states have internal predecessors, (731), 173 states have call successors, (173), 66 states have call predecessors, (173), 65 states have return successors, (172), 165 states have call predecessors, (172), 169 states have call successors, (172) [2022-11-21 16:44:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1076 transitions. [2022-11-21 16:44:19,177 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1076 transitions. Word has length 16 [2022-11-21 16:44:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:19,178 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1076 transitions. [2022-11-21 16:44:19,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:44:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1076 transitions. [2022-11-21 16:44:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:44:19,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:19,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:44:19,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:44:19,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:19,181 INFO L85 PathProgramCache]: Analyzing trace with hash 208359179, now seen corresponding path program 1 times [2022-11-21 16:44:19,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:19,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178872212] [2022-11-21 16:44:19,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:19,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:19,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:44:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:19,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178872212] [2022-11-21 16:44:19,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178872212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:19,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:19,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:44:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189342362] [2022-11-21 16:44:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:19,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:44:19,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:19,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:44:19,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:44:19,338 INFO L87 Difference]: Start difference. First operand 820 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:44:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:19,471 INFO L93 Difference]: Finished difference Result 2433 states and 3207 transitions. [2022-11-21 16:44:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:44:19,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-21 16:44:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:19,482 INFO L225 Difference]: With dead ends: 2433 [2022-11-21 16:44:19,482 INFO L226 Difference]: Without dead ends: 1617 [2022-11-21 16:44:19,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:44:19,487 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 535 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:19,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:44:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2022-11-21 16:44:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1610. [2022-11-21 16:44:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1141 states have (on average 1.2541630148992111) internal successors, (1431), 1160 states have internal predecessors, (1431), 340 states have call successors, (340), 129 states have call predecessors, (340), 128 states have return successors, (346), 328 states have call predecessors, (346), 336 states have call successors, (346) [2022-11-21 16:44:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2022-11-21 16:44:19,603 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 17 [2022-11-21 16:44:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:19,604 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2022-11-21 16:44:19,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:44:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2022-11-21 16:44:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 16:44:19,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:19,619 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:44:19,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:44:19,619 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:19,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:19,620 INFO L85 PathProgramCache]: Analyzing trace with hash 26582145, now seen corresponding path program 1 times [2022-11-21 16:44:19,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:19,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543149023] [2022-11-21 16:44:19,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:19,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:19,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:20,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:44:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:20,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:44:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:20,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:44:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:20,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:44:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:20,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:20,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:44:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:20,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:44:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:44:20,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:20,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543149023] [2022-11-21 16:44:20,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543149023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:20,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:20,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:44:20,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741945482] [2022-11-21 16:44:20,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:20,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:44:20,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:20,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:44:20,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:44:20,257 INFO L87 Difference]: Start difference. First operand 1610 states and 2117 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:44:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:23,320 INFO L93 Difference]: Finished difference Result 3324 states and 4411 transitions. [2022-11-21 16:44:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:44:23,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-11-21 16:44:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:23,334 INFO L225 Difference]: With dead ends: 3324 [2022-11-21 16:44:23,334 INFO L226 Difference]: Without dead ends: 1722 [2022-11-21 16:44:23,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:44:23,341 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 242 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:23,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1843 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-21 16:44:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-11-21 16:44:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1610. [2022-11-21 16:44:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1141 states have (on average 1.2532865907099036) internal successors, (1430), 1160 states have internal predecessors, (1430), 340 states have call successors, (340), 129 states have call predecessors, (340), 128 states have return successors, (346), 328 states have call predecessors, (346), 336 states have call successors, (346) [2022-11-21 16:44:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2116 transitions. [2022-11-21 16:44:23,437 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2116 transitions. Word has length 71 [2022-11-21 16:44:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:23,438 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2116 transitions. [2022-11-21 16:44:23,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:44:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2116 transitions. [2022-11-21 16:44:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 16:44:23,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:23,441 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:44:23,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:44:23,442 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:23,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2146869344, now seen corresponding path program 1 times [2022-11-21 16:44:23,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:23,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337474156] [2022-11-21 16:44:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:23,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:23,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:23,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:44:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:44:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:23,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:44:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:44:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:23,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:44:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:44:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:44:23,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:23,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337474156] [2022-11-21 16:44:23,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337474156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:23,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:23,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:44:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012093258] [2022-11-21 16:44:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:23,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:44:23,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:23,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:44:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:44:23,834 INFO L87 Difference]: Start difference. First operand 1610 states and 2116 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:44:28,288 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-21 16:44:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:28,321 INFO L93 Difference]: Finished difference Result 4036 states and 5567 transitions. [2022-11-21 16:44:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:44:28,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-11-21 16:44:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:28,335 INFO L225 Difference]: With dead ends: 4036 [2022-11-21 16:44:28,335 INFO L226 Difference]: Without dead ends: 2437 [2022-11-21 16:44:28,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:44:28,341 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 444 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 301 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:28,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1252 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 745 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-11-21 16:44:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-11-21 16:44:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2313. [2022-11-21 16:44:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 1640 states have (on average 1.2939024390243903) internal successors, (2122), 1675 states have internal predecessors, (2122), 544 states have call successors, (544), 129 states have call predecessors, (544), 128 states have return successors, (558), 524 states have call predecessors, (558), 540 states have call successors, (558) [2022-11-21 16:44:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3224 transitions. [2022-11-21 16:44:28,521 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3224 transitions. Word has length 71 [2022-11-21 16:44:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:28,521 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3224 transitions. [2022-11-21 16:44:28,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:44:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3224 transitions. [2022-11-21 16:44:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 16:44:28,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:28,524 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:44:28,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:44:28,525 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:28,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569613, now seen corresponding path program 1 times [2022-11-21 16:44:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:28,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526479075] [2022-11-21 16:44:28,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:28,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:28,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:28,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:44:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:28,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:44:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:28,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-21 16:44:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:44:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:44:28,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:28,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526479075] [2022-11-21 16:44:28,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526479075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:28,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:28,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:44:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800157911] [2022-11-21 16:44:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:28,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:44:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:28,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:44:28,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:44:28,828 INFO L87 Difference]: Start difference. First operand 2313 states and 3224 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:44:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:30,657 INFO L93 Difference]: Finished difference Result 6341 states and 9294 transitions. [2022-11-21 16:44:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:44:30,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2022-11-21 16:44:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:30,683 INFO L225 Difference]: With dead ends: 6341 [2022-11-21 16:44:30,683 INFO L226 Difference]: Without dead ends: 4040 [2022-11-21 16:44:30,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:44:30,692 INFO L413 NwaCegarLoop]: 747 mSDtfsCounter, 571 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:30,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 2500 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-21 16:44:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2022-11-21 16:44:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 2347. [2022-11-21 16:44:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1668 states have (on average 1.290167865707434) internal successors, (2152), 1705 states have internal predecessors, (2152), 544 states have call successors, (544), 129 states have call predecessors, (544), 134 states have return successors, (580), 528 states have call predecessors, (580), 540 states have call successors, (580) [2022-11-21 16:44:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3276 transitions. [2022-11-21 16:44:30,875 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3276 transitions. Word has length 68 [2022-11-21 16:44:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:30,875 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 3276 transitions. [2022-11-21 16:44:30,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:44:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3276 transitions. [2022-11-21 16:44:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 16:44:30,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:30,879 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:44:30,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:44:30,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1776712988, now seen corresponding path program 1 times [2022-11-21 16:44:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:30,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894923002] [2022-11-21 16:44:30,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:31,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:31,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:44:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:31,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:44:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:31,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:31,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:44:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:31,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:44:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:44:31,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:31,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894923002] [2022-11-21 16:44:31,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894923002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:31,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:31,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:44:31,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518096763] [2022-11-21 16:44:31,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:31,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:44:31,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:31,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:44:31,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:44:31,318 INFO L87 Difference]: Start difference. First operand 2347 states and 3276 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:44:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:32,924 INFO L93 Difference]: Finished difference Result 5919 states and 8590 transitions. [2022-11-21 16:44:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:44:32,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2022-11-21 16:44:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:32,945 INFO L225 Difference]: With dead ends: 5919 [2022-11-21 16:44:32,945 INFO L226 Difference]: Without dead ends: 3584 [2022-11-21 16:44:32,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:44:32,954 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 460 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:32,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 2379 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-21 16:44:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2022-11-21 16:44:33,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 2363. [2022-11-21 16:44:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 1684 states have (on average 1.2874109263657958) internal successors, (2168), 1721 states have internal predecessors, (2168), 544 states have call successors, (544), 129 states have call predecessors, (544), 134 states have return successors, (580), 528 states have call predecessors, (580), 540 states have call successors, (580) [2022-11-21 16:44:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3292 transitions. [2022-11-21 16:44:33,196 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3292 transitions. Word has length 69 [2022-11-21 16:44:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:33,197 INFO L495 AbstractCegarLoop]: Abstraction has 2363 states and 3292 transitions. [2022-11-21 16:44:33,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:44:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3292 transitions. [2022-11-21 16:44:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 16:44:33,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:33,200 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:44:33,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:44:33,201 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:33,202 INFO L85 PathProgramCache]: Analyzing trace with hash 676145405, now seen corresponding path program 1 times [2022-11-21 16:44:33,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:33,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245029647] [2022-11-21 16:44:33,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:33,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:33,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:44:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:44:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:33,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:33,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:33,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:44:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:44:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:44:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:33,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245029647] [2022-11-21 16:44:33,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245029647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:33,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:33,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:44:33,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448408044] [2022-11-21 16:44:33,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:33,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:44:33,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:33,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:44:33,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:44:33,848 INFO L87 Difference]: Start difference. First operand 2363 states and 3292 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:44:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:36,094 INFO L93 Difference]: Finished difference Result 3619 states and 5113 transitions. [2022-11-21 16:44:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:44:36,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2022-11-21 16:44:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:36,108 INFO L225 Difference]: With dead ends: 3619 [2022-11-21 16:44:36,108 INFO L226 Difference]: Without dead ends: 2425 [2022-11-21 16:44:36,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:44:36,114 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 125 mSDsluCounter, 2307 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 2727 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:36,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 2727 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-21 16:44:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2022-11-21 16:44:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2377. [2022-11-21 16:44:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 1694 states have (on average 1.2845336481700118) internal successors, (2176), 1731 states have internal predecessors, (2176), 544 states have call successors, (544), 129 states have call predecessors, (544), 138 states have return successors, (592), 532 states have call predecessors, (592), 540 states have call successors, (592) [2022-11-21 16:44:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3312 transitions. [2022-11-21 16:44:36,334 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3312 transitions. Word has length 69 [2022-11-21 16:44:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:36,337 INFO L495 AbstractCegarLoop]: Abstraction has 2377 states and 3312 transitions. [2022-11-21 16:44:36,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:44:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3312 transitions. [2022-11-21 16:44:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 16:44:36,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:36,340 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:44:36,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:44:36,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958436, now seen corresponding path program 1 times [2022-11-21 16:44:36,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:36,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333494212] [2022-11-21 16:44:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:36,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:44:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:36,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:44:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:36,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:36,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:44:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:36,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:44:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:44:36,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:36,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333494212] [2022-11-21 16:44:36,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333494212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:36,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:36,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-21 16:44:36,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85796653] [2022-11-21 16:44:36,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:36,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 16:44:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:36,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 16:44:36,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:44:36,854 INFO L87 Difference]: Start difference. First operand 2377 states and 3312 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:44:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:39,726 INFO L93 Difference]: Finished difference Result 5577 states and 8014 transitions. [2022-11-21 16:44:39,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:44:39,727 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2022-11-21 16:44:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:39,746 INFO L225 Difference]: With dead ends: 5577 [2022-11-21 16:44:39,747 INFO L226 Difference]: Without dead ends: 3212 [2022-11-21 16:44:39,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:44:39,757 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 454 mSDsluCounter, 5486 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 6275 SdHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:39,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 6275 Invalid, 2629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-21 16:44:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2022-11-21 16:44:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 2381. [2022-11-21 16:44:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 1698 states have (on average 1.28150765606596) internal successors, (2176), 1733 states have internal predecessors, (2176), 544 states have call successors, (544), 129 states have call predecessors, (544), 138 states have return successors, (592), 534 states have call predecessors, (592), 540 states have call successors, (592) [2022-11-21 16:44:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3312 transitions. [2022-11-21 16:44:39,938 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3312 transitions. Word has length 69 [2022-11-21 16:44:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:39,939 INFO L495 AbstractCegarLoop]: Abstraction has 2381 states and 3312 transitions. [2022-11-21 16:44:39,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:44:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3312 transitions. [2022-11-21 16:44:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-21 16:44:39,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:39,946 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:44:39,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:44:39,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:39,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1804654053, now seen corresponding path program 1 times [2022-11-21 16:44:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:39,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788607554] [2022-11-21 16:44:39,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:39,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:40,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:44:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:40,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:44:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:40,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:40,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:40,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:44:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:40,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:40,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:44:40,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:40,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788607554] [2022-11-21 16:44:40,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788607554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:40,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:40,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:44:40,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488157682] [2022-11-21 16:44:40,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:40,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:44:40,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:40,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:44:40,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:44:40,533 INFO L87 Difference]: Start difference. First operand 2381 states and 3312 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:44:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:42,748 INFO L93 Difference]: Finished difference Result 5739 states and 8248 transitions. [2022-11-21 16:44:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:44:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 75 [2022-11-21 16:44:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:42,768 INFO L225 Difference]: With dead ends: 5739 [2022-11-21 16:44:42,768 INFO L226 Difference]: Without dead ends: 3370 [2022-11-21 16:44:42,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:44:42,780 INFO L413 NwaCegarLoop]: 697 mSDtfsCounter, 400 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 3565 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:42,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 3565 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-21 16:44:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-11-21 16:44:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 2179. [2022-11-21 16:44:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1560 states have (on average 1.2717948717948717) internal successors, (1984), 1579 states have internal predecessors, (1984), 480 states have call successors, (480), 127 states have call predecessors, (480), 138 states have return successors, (532), 480 states have call predecessors, (532), 476 states have call successors, (532) [2022-11-21 16:44:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2996 transitions. [2022-11-21 16:44:42,987 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 2996 transitions. Word has length 75 [2022-11-21 16:44:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:42,987 INFO L495 AbstractCegarLoop]: Abstraction has 2179 states and 2996 transitions. [2022-11-21 16:44:42,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:44:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2996 transitions. [2022-11-21 16:44:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-21 16:44:42,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:42,993 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:44:42,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:44:42,994 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:42,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:42,994 INFO L85 PathProgramCache]: Analyzing trace with hash -506709307, now seen corresponding path program 1 times [2022-11-21 16:44:42,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:42,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109385054] [2022-11-21 16:44:42,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:42,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:43,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:44:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:43,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:44:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:43,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:43,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:43,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:44:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:43,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:43,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:44:43,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:43,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109385054] [2022-11-21 16:44:43,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109385054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:43,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:43,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:44:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99268537] [2022-11-21 16:44:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:43,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:44:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:43,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:44:43,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:44:43,474 INFO L87 Difference]: Start difference. First operand 2179 states and 2996 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-21 16:44:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:47,190 INFO L93 Difference]: Finished difference Result 3452 states and 4818 transitions. [2022-11-21 16:44:47,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:44:47,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 75 [2022-11-21 16:44:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:47,211 INFO L225 Difference]: With dead ends: 3452 [2022-11-21 16:44:47,212 INFO L226 Difference]: Without dead ends: 3447 [2022-11-21 16:44:47,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:44:47,215 INFO L413 NwaCegarLoop]: 671 mSDtfsCounter, 2453 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 1107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2566 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1107 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:47,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2566 Valid, 2063 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1107 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-21 16:44:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2022-11-21 16:44:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3363. [2022-11-21 16:44:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3363 states, 2405 states have (on average 1.2752598752598752) internal successors, (3067), 2440 states have internal predecessors, (3067), 748 states have call successors, (748), 189 states have call predecessors, (748), 209 states have return successors, (870), 749 states have call predecessors, (870), 744 states have call successors, (870) [2022-11-21 16:44:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4685 transitions. [2022-11-21 16:44:47,501 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4685 transitions. Word has length 75 [2022-11-21 16:44:47,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:47,501 INFO L495 AbstractCegarLoop]: Abstraction has 3363 states and 4685 transitions. [2022-11-21 16:44:47,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-21 16:44:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4685 transitions. [2022-11-21 16:44:47,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-21 16:44:47,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:47,505 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:44:47,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:44:47,506 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:47,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:47,506 INFO L85 PathProgramCache]: Analyzing trace with hash -9266808, now seen corresponding path program 1 times [2022-11-21 16:44:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:47,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900354688] [2022-11-21 16:44:47,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:47,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:47,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:47,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:44:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:47,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:44:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:47,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:44:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:47,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:44:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:44:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:48,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:48,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:48,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:44:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:48,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:44:48,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:48,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900354688] [2022-11-21 16:44:48,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900354688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:48,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:48,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:44:48,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232435300] [2022-11-21 16:44:48,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:48,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:44:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:48,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:44:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:44:48,125 INFO L87 Difference]: Start difference. First operand 3363 states and 4685 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:44:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:50,163 INFO L93 Difference]: Finished difference Result 7643 states and 10959 transitions. [2022-11-21 16:44:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:44:50,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2022-11-21 16:44:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:50,187 INFO L225 Difference]: With dead ends: 7643 [2022-11-21 16:44:50,188 INFO L226 Difference]: Without dead ends: 4292 [2022-11-21 16:44:50,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:44:50,200 INFO L413 NwaCegarLoop]: 686 mSDtfsCounter, 620 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 2661 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:50,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 2661 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-21 16:44:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2022-11-21 16:44:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 2826. [2022-11-21 16:44:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2031 states have (on average 1.2737567700640078) internal successors, (2587), 2057 states have internal predecessors, (2587), 624 states have call successors, (624), 153 states have call predecessors, (624), 170 states have return successors, (730), 631 states have call predecessors, (730), 620 states have call successors, (730) [2022-11-21 16:44:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3941 transitions. [2022-11-21 16:44:50,521 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3941 transitions. Word has length 94 [2022-11-21 16:44:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:50,522 INFO L495 AbstractCegarLoop]: Abstraction has 2826 states and 3941 transitions. [2022-11-21 16:44:50,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:44:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3941 transitions. [2022-11-21 16:44:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-21 16:44:50,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:50,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:44:50,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:44:50,526 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:50,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash 564700489, now seen corresponding path program 1 times [2022-11-21 16:44:50,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:50,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279086388] [2022-11-21 16:44:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:50,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:50,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:50,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:44:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:44:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:50,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:44:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:50,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:44:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:44:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:51,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:51,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 16:44:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:51,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-21 16:44:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:51,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:44:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:44:51,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:51,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279086388] [2022-11-21 16:44:51,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279086388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:51,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:51,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-21 16:44:51,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922910362] [2022-11-21 16:44:51,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:51,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 16:44:51,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:51,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 16:44:51,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:44:51,194 INFO L87 Difference]: Start difference. First operand 2826 states and 3941 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:44:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:54,463 INFO L93 Difference]: Finished difference Result 6776 states and 9771 transitions. [2022-11-21 16:44:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:44:54,464 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 92 [2022-11-21 16:44:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:54,484 INFO L225 Difference]: With dead ends: 6776 [2022-11-21 16:44:54,484 INFO L226 Difference]: Without dead ends: 4370 [2022-11-21 16:44:54,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:44:54,493 INFO L413 NwaCegarLoop]: 685 mSDtfsCounter, 439 mSDsluCounter, 5103 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 5788 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:54,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 5788 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2617 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-21 16:44:54,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2022-11-21 16:44:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 2826. [2022-11-21 16:44:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2031 states have (on average 1.2698178237321516) internal successors, (2579), 2057 states have internal predecessors, (2579), 624 states have call successors, (624), 153 states have call predecessors, (624), 170 states have return successors, (730), 631 states have call predecessors, (730), 620 states have call successors, (730) [2022-11-21 16:44:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3933 transitions. [2022-11-21 16:44:54,768 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3933 transitions. Word has length 92 [2022-11-21 16:44:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:54,768 INFO L495 AbstractCegarLoop]: Abstraction has 2826 states and 3933 transitions. [2022-11-21 16:44:54,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:44:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3933 transitions. [2022-11-21 16:44:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-21 16:44:54,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:54,772 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:44:54,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:44:54,772 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:54,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:54,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1871827029, now seen corresponding path program 1 times [2022-11-21 16:44:54,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:54,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592574539] [2022-11-21 16:44:54,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:54,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:55,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:44:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:55,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:44:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:55,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:55,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:55,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:44:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:55,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:55,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:55,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 16:44:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:44:55,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:55,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592574539] [2022-11-21 16:44:55,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592574539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:55,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:55,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:44:55,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532746320] [2022-11-21 16:44:55,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:55,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:44:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:55,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:44:55,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:44:55,331 INFO L87 Difference]: Start difference. First operand 2826 states and 3933 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-21 16:44:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:57,016 INFO L93 Difference]: Finished difference Result 6262 states and 9007 transitions. [2022-11-21 16:44:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:44:57,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2022-11-21 16:44:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:57,034 INFO L225 Difference]: With dead ends: 6262 [2022-11-21 16:44:57,035 INFO L226 Difference]: Without dead ends: 3856 [2022-11-21 16:44:57,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:44:57,042 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 519 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:57,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 2694 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-21 16:44:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2022-11-21 16:44:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 2636. [2022-11-21 16:44:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 1899 states have (on average 1.2622432859399684) internal successors, (2397), 1911 states have internal predecessors, (2397), 568 states have call successors, (568), 151 states have call predecessors, (568), 168 states have return successors, (670), 585 states have call predecessors, (670), 564 states have call successors, (670) [2022-11-21 16:44:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3635 transitions. [2022-11-21 16:44:57,262 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3635 transitions. Word has length 87 [2022-11-21 16:44:57,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:44:57,263 INFO L495 AbstractCegarLoop]: Abstraction has 2636 states and 3635 transitions. [2022-11-21 16:44:57,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-21 16:44:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3635 transitions. [2022-11-21 16:44:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-21 16:44:57,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:44:57,267 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:44:57,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:44:57,267 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:44:57,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:44:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash -205382314, now seen corresponding path program 1 times [2022-11-21 16:44:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:44:57,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331791123] [2022-11-21 16:44:57,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:44:57,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:44:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:57,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:44:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:57,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:44:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:57,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:44:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:57,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:57,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:57,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:44:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:44:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:44:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:57,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 16:44:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:44:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:44:57,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:44:57,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331791123] [2022-11-21 16:44:57,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331791123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:44:57,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:44:57,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:44:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921839375] [2022-11-21 16:44:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:44:57,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:44:57,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:44:57,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:44:57,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:44:57,941 INFO L87 Difference]: Start difference. First operand 2636 states and 3635 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-21 16:44:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:44:59,900 INFO L93 Difference]: Finished difference Result 3905 states and 5433 transitions. [2022-11-21 16:44:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:44:59,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 87 [2022-11-21 16:44:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:44:59,913 INFO L225 Difference]: With dead ends: 3905 [2022-11-21 16:44:59,913 INFO L226 Difference]: Without dead ends: 2681 [2022-11-21 16:44:59,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:44:59,918 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 350 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:44:59,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 2406 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-21 16:44:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2022-11-21 16:45:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2644. [2022-11-21 16:45:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 1907 states have (on average 1.261143156790771) internal successors, (2405), 1915 states have internal predecessors, (2405), 568 states have call successors, (568), 151 states have call predecessors, (568), 168 states have return successors, (670), 589 states have call predecessors, (670), 564 states have call successors, (670) [2022-11-21 16:45:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3643 transitions. [2022-11-21 16:45:00,161 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3643 transitions. Word has length 87 [2022-11-21 16:45:00,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:45:00,162 INFO L495 AbstractCegarLoop]: Abstraction has 2644 states and 3643 transitions. [2022-11-21 16:45:00,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-21 16:45:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3643 transitions. [2022-11-21 16:45:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-21 16:45:00,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:45:00,165 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:45:00,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:45:00,166 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:45:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:45:00,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2079481141, now seen corresponding path program 1 times [2022-11-21 16:45:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:45:00,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168677583] [2022-11-21 16:45:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:00,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:45:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:00,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:45:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:00,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:45:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:00,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:45:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:00,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:00,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:00,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:45:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:00,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:00,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 16:45:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:45:00,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:45:00,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168677583] [2022-11-21 16:45:00,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168677583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:45:00,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:45:00,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:45:00,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591722579] [2022-11-21 16:45:00,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:45:00,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:45:00,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:45:00,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:45:00,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:45:00,448 INFO L87 Difference]: Start difference. First operand 2644 states and 3643 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-21 16:45:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:45:01,923 INFO L93 Difference]: Finished difference Result 4660 states and 6627 transitions. [2022-11-21 16:45:01,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:45:01,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2022-11-21 16:45:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:45:01,937 INFO L225 Difference]: With dead ends: 4660 [2022-11-21 16:45:01,937 INFO L226 Difference]: Without dead ends: 3432 [2022-11-21 16:45:01,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:45:01,945 INFO L413 NwaCegarLoop]: 713 mSDtfsCounter, 429 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:45:01,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1992 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 16:45:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2022-11-21 16:45:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2652. [2022-11-21 16:45:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 1915 states have (on average 1.2600522193211487) internal successors, (2413), 1923 states have internal predecessors, (2413), 568 states have call successors, (568), 151 states have call predecessors, (568), 168 states have return successors, (670), 589 states have call predecessors, (670), 564 states have call successors, (670) [2022-11-21 16:45:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3651 transitions. [2022-11-21 16:45:02,206 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3651 transitions. Word has length 87 [2022-11-21 16:45:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:45:02,206 INFO L495 AbstractCegarLoop]: Abstraction has 2652 states and 3651 transitions. [2022-11-21 16:45:02,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-21 16:45:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3651 transitions. [2022-11-21 16:45:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-21 16:45:02,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:45:02,211 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:45:02,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:45:02,212 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:45:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:45:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 390816807, now seen corresponding path program 1 times [2022-11-21 16:45:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:45:02,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622902070] [2022-11-21 16:45:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:45:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:02,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:45:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:02,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:45:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:02,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:45:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:02,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:45:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:02,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-21 16:45:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:02,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:45:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:02,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:45:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:02,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:02,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:45:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:02,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:45:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 16:45:02,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:45:02,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622902070] [2022-11-21 16:45:02,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622902070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:45:02,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:45:02,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:45:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695736015] [2022-11-21 16:45:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:45:02,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:45:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:45:02,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:45:02,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:45:02,480 INFO L87 Difference]: Start difference. First operand 2652 states and 3651 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:45:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:45:05,082 INFO L93 Difference]: Finished difference Result 5424 states and 7473 transitions. [2022-11-21 16:45:05,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:45:05,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2022-11-21 16:45:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:45:05,093 INFO L225 Difference]: With dead ends: 5424 [2022-11-21 16:45:05,093 INFO L226 Difference]: Without dead ends: 2778 [2022-11-21 16:45:05,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:45:05,102 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 254 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:45:05,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1518 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-21 16:45:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2022-11-21 16:45:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2664. [2022-11-21 16:45:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 1923 states have (on average 1.2584503380135206) internal successors, (2420), 1931 states have internal predecessors, (2420), 570 states have call successors, (570), 153 states have call predecessors, (570), 170 states have return successors, (672), 591 states have call predecessors, (672), 566 states have call successors, (672) [2022-11-21 16:45:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3662 transitions. [2022-11-21 16:45:05,449 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3662 transitions. Word has length 94 [2022-11-21 16:45:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:45:05,449 INFO L495 AbstractCegarLoop]: Abstraction has 2664 states and 3662 transitions. [2022-11-21 16:45:05,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:45:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3662 transitions. [2022-11-21 16:45:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-21 16:45:05,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:45:05,452 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:45:05,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:45:05,453 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:45:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:45:05,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1118734186, now seen corresponding path program 1 times [2022-11-21 16:45:05,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:45:05,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081941557] [2022-11-21 16:45:05,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:05,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:45:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:05,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:45:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:05,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:45:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:05,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:45:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:05,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:05,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:05,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:45:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:05,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:06,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:06,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:45:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:45:06,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:45:06,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081941557] [2022-11-21 16:45:06,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081941557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:45:06,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:45:06,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:45:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494606325] [2022-11-21 16:45:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:45:06,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:45:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:45:06,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:45:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:45:06,021 INFO L87 Difference]: Start difference. First operand 2664 states and 3662 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 6 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-21 16:45:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:45:09,856 INFO L93 Difference]: Finished difference Result 3982 states and 5507 transitions. [2022-11-21 16:45:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:45:09,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 6 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 89 [2022-11-21 16:45:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:45:09,872 INFO L225 Difference]: With dead ends: 3982 [2022-11-21 16:45:09,873 INFO L226 Difference]: Without dead ends: 3979 [2022-11-21 16:45:09,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:45:09,875 INFO L413 NwaCegarLoop]: 749 mSDtfsCounter, 2107 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2236 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:45:09,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2236 Valid, 2646 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-21 16:45:09,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2022-11-21 16:45:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3879. [2022-11-21 16:45:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3879 states, 2797 states have (on average 1.2609939220593493) internal successors, (3527), 2814 states have internal predecessors, (3527), 838 states have call successors, (838), 215 states have call predecessors, (838), 243 states have return successors, (1014), 869 states have call predecessors, (1014), 834 states have call successors, (1014) [2022-11-21 16:45:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 5379 transitions. [2022-11-21 16:45:10,299 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 5379 transitions. Word has length 89 [2022-11-21 16:45:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:45:10,299 INFO L495 AbstractCegarLoop]: Abstraction has 3879 states and 5379 transitions. [2022-11-21 16:45:10,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 6 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-21 16:45:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 5379 transitions. [2022-11-21 16:45:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-21 16:45:10,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:45:10,303 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:45:10,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:45:10,303 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:45:10,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:45:10,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1748979270, now seen corresponding path program 1 times [2022-11-21 16:45:10,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:45:10,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876766120] [2022-11-21 16:45:10,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:10,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:45:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:10,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:45:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:10,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:45:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:10,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:45:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:10,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:10,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:10,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:45:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:10,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:10,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:10,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:45:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:11,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 16:45:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 16:45:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:45:11,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:45:11,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876766120] [2022-11-21 16:45:11,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876766120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:45:11,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846389818] [2022-11-21 16:45:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:11,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:45:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:45:11,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:45:11,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:45:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:11,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 1365 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 16:45:11,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:45:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:45:12,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:45:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:45:12,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846389818] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:45:12,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:45:12,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2022-11-21 16:45:12,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436776647] [2022-11-21 16:45:12,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:45:12,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-21 16:45:12,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:45:12,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-21 16:45:12,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2022-11-21 16:45:12,307 INFO L87 Difference]: Start difference. First operand 3879 states and 5379 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (19), 10 states have call predecessors, (19), 5 states have call successors, (19) [2022-11-21 16:45:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:45:20,841 INFO L93 Difference]: Finished difference Result 11133 states and 16255 transitions. [2022-11-21 16:45:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 16:45:20,841 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (19), 10 states have call predecessors, (19), 5 states have call successors, (19) Word has length 94 [2022-11-21 16:45:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:45:20,871 INFO L225 Difference]: With dead ends: 11133 [2022-11-21 16:45:20,871 INFO L226 Difference]: Without dead ends: 7266 [2022-11-21 16:45:20,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=1715, Unknown=0, NotChecked=0, Total=1892 [2022-11-21 16:45:20,886 INFO L413 NwaCegarLoop]: 804 mSDtfsCounter, 1027 mSDsluCounter, 12825 mSDsCounter, 0 mSdLazyCounter, 7920 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 13629 SdHoareTripleChecker+Invalid, 8467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 7920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:45:20,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 13629 Invalid, 8467 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [547 Valid, 7920 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-11-21 16:45:20,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7266 states. [2022-11-21 16:45:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7266 to 3833. [2022-11-21 16:45:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 2762 states have (on average 1.2617668356263576) internal successors, (3485), 2796 states have internal predecessors, (3485), 834 states have call successors, (834), 215 states have call predecessors, (834), 236 states have return successors, (952), 835 states have call predecessors, (952), 828 states have call successors, (952) [2022-11-21 16:45:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 5271 transitions. [2022-11-21 16:45:21,440 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 5271 transitions. Word has length 94 [2022-11-21 16:45:21,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:45:21,441 INFO L495 AbstractCegarLoop]: Abstraction has 3833 states and 5271 transitions. [2022-11-21 16:45:21,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (19), 10 states have call predecessors, (19), 5 states have call successors, (19) [2022-11-21 16:45:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 5271 transitions. [2022-11-21 16:45:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-21 16:45:21,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:45:21,445 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:45:21,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:45:21,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 16:45:21,667 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:45:21,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:45:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash -448437055, now seen corresponding path program 1 times [2022-11-21 16:45:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:45:21,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203301498] [2022-11-21 16:45:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:45:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:45:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:45:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:45:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:45:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:45:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:45:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-21 16:45:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 16:45:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:45:22,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203301498] [2022-11-21 16:45:22,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203301498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:45:22,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:45:22,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-21 16:45:22,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709182066] [2022-11-21 16:45:22,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:45:22,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 16:45:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:45:22,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 16:45:22,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:45:22,392 INFO L87 Difference]: Start difference. First operand 3833 states and 5271 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-21 16:45:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:45:27,489 INFO L93 Difference]: Finished difference Result 10144 states and 13936 transitions. [2022-11-21 16:45:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:45:27,490 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 96 [2022-11-21 16:45:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:45:27,525 INFO L225 Difference]: With dead ends: 10144 [2022-11-21 16:45:27,526 INFO L226 Difference]: Without dead ends: 8384 [2022-11-21 16:45:27,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-11-21 16:45:27,536 INFO L413 NwaCegarLoop]: 658 mSDtfsCounter, 1982 mSDsluCounter, 2846 mSDsCounter, 0 mSdLazyCounter, 2823 mSolverCounterSat, 854 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2095 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 854 IncrementalHoareTripleChecker+Valid, 2823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:45:27,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2095 Valid, 3504 Invalid, 3677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [854 Valid, 2823 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-21 16:45:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8384 states. [2022-11-21 16:45:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8384 to 8132. [2022-11-21 16:45:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8132 states, 5885 states have (on average 1.2677994902293968) internal successors, (7461), 5936 states have internal predecessors, (7461), 1737 states have call successors, (1737), 461 states have call predecessors, (1737), 509 states have return successors, (1983), 1758 states have call predecessors, (1983), 1731 states have call successors, (1983) [2022-11-21 16:45:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 11181 transitions. [2022-11-21 16:45:28,436 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 11181 transitions. Word has length 96 [2022-11-21 16:45:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:45:28,436 INFO L495 AbstractCegarLoop]: Abstraction has 8132 states and 11181 transitions. [2022-11-21 16:45:28,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-21 16:45:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 11181 transitions. [2022-11-21 16:45:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-21 16:45:28,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:45:28,440 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:45:28,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 16:45:28,441 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:45:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:45:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash 832679025, now seen corresponding path program 1 times [2022-11-21 16:45:28,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:45:28,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290830989] [2022-11-21 16:45:28,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:28,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:45:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:45:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:28,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:45:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:45:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:45:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:28,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:28,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:29,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:45:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:29,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:45:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:29,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-21 16:45:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:45:29,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:45:29,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290830989] [2022-11-21 16:45:29,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290830989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:45:29,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:45:29,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-21 16:45:29,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928952561] [2022-11-21 16:45:29,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:45:29,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:45:29,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:45:29,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:45:29,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:45:29,029 INFO L87 Difference]: Start difference. First operand 8132 states and 11181 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:45:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:45:33,767 INFO L93 Difference]: Finished difference Result 17611 states and 24834 transitions. [2022-11-21 16:45:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:45:33,768 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2022-11-21 16:45:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:45:33,803 INFO L225 Difference]: With dead ends: 17611 [2022-11-21 16:45:33,804 INFO L226 Difference]: Without dead ends: 10847 [2022-11-21 16:45:33,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-11-21 16:45:33,820 INFO L413 NwaCegarLoop]: 672 mSDtfsCounter, 470 mSDsluCounter, 5641 mSDsCounter, 0 mSdLazyCounter, 3273 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 6313 SdHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 3273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:45:33,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 6313 Invalid, 3472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 3273 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-21 16:45:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10847 states. [2022-11-21 16:45:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10847 to 8126. [2022-11-21 16:45:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8126 states, 5879 states have (on average 1.2639904745705053) internal successors, (7431), 5933 states have internal predecessors, (7431), 1737 states have call successors, (1737), 461 states have call predecessors, (1737), 509 states have return successors, (1983), 1755 states have call predecessors, (1983), 1731 states have call successors, (1983) [2022-11-21 16:45:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 11151 transitions. [2022-11-21 16:45:34,806 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 11151 transitions. Word has length 97 [2022-11-21 16:45:34,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:45:34,807 INFO L495 AbstractCegarLoop]: Abstraction has 8126 states and 11151 transitions. [2022-11-21 16:45:34,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:45:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 11151 transitions. [2022-11-21 16:45:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-21 16:45:34,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:45:34,812 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:45:34,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 16:45:34,813 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:45:34,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:45:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1118058599, now seen corresponding path program 1 times [2022-11-21 16:45:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:45:34,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481227849] [2022-11-21 16:45:34,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:34,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:45:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:45:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:45:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 16:45:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 16:45:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:45:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:45:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:45:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:45:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-21 16:45:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:45:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 16:45:35,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:45:35,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481227849] [2022-11-21 16:45:35,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481227849] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:45:35,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563132794] [2022-11-21 16:45:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:35,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:45:35,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:45:35,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:45:35,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:45:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:36,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:45:36,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:45:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 16:45:36,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:45:36,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563132794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:45:36,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:45:36,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-11-21 16:45:36,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100057227] [2022-11-21 16:45:36,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:45:36,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:45:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:45:36,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:45:36,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:45:36,102 INFO L87 Difference]: Start difference. First operand 8126 states and 11151 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-21 16:45:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:45:36,827 INFO L93 Difference]: Finished difference Result 16288 states and 22354 transitions. [2022-11-21 16:45:36,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:45:36,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2022-11-21 16:45:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:45:36,846 INFO L225 Difference]: With dead ends: 16288 [2022-11-21 16:45:36,847 INFO L226 Difference]: Without dead ends: 8174 [2022-11-21 16:45:36,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:45:36,862 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 1 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:45:36,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1083 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:45:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8174 states. [2022-11-21 16:45:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8174 to 8158. [2022-11-21 16:45:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8158 states, 5911 states have (on average 1.2625613263407207) internal successors, (7463), 5965 states have internal predecessors, (7463), 1737 states have call successors, (1737), 461 states have call predecessors, (1737), 509 states have return successors, (1983), 1755 states have call predecessors, (1983), 1731 states have call successors, (1983) [2022-11-21 16:45:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 11183 transitions. [2022-11-21 16:45:37,845 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 11183 transitions. Word has length 108 [2022-11-21 16:45:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:45:37,846 INFO L495 AbstractCegarLoop]: Abstraction has 8158 states and 11183 transitions. [2022-11-21 16:45:37,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-21 16:45:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 11183 transitions. [2022-11-21 16:45:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-21 16:45:37,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:45:37,851 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:45:37,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:45:38,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:45:38,062 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:45:38,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:45:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 920282283, now seen corresponding path program 1 times [2022-11-21 16:45:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:45:38,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730792506] [2022-11-21 16:45:38,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:38,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:45:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:45:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:45:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:45:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:45:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:45:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:45:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:45:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-21 16:45:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 16:45:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:45:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-21 16:45:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-21 16:45:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 16:45:38,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:45:38,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730792506] [2022-11-21 16:45:38,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730792506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:45:38,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:45:38,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:45:38,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454725462] [2022-11-21 16:45:38,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:45:38,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:45:38,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:45:38,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:45:38,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:45:38,863 INFO L87 Difference]: Start difference. First operand 8158 states and 11183 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-21 16:45:43,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:45:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:45:48,049 INFO L93 Difference]: Finished difference Result 18980 states and 26789 transitions. [2022-11-21 16:45:48,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:45:48,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2022-11-21 16:45:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:45:48,085 INFO L225 Difference]: With dead ends: 18980 [2022-11-21 16:45:48,085 INFO L226 Difference]: Without dead ends: 12202 [2022-11-21 16:45:48,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:45:48,102 INFO L413 NwaCegarLoop]: 675 mSDtfsCounter, 520 mSDsluCounter, 2901 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 3576 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:45:48,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 3576 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-21 16:45:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12202 states. [2022-11-21 16:45:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12202 to 7987. [2022-11-21 16:45:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7987 states, 5818 states have (on average 1.2619456858026814) internal successors, (7342), 5860 states have internal predecessors, (7342), 1675 states have call successors, (1675), 445 states have call predecessors, (1675), 493 states have return successors, (1921), 1705 states have call predecessors, (1921), 1669 states have call successors, (1921) [2022-11-21 16:45:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7987 states to 7987 states and 10938 transitions. [2022-11-21 16:45:49,049 INFO L78 Accepts]: Start accepts. Automaton has 7987 states and 10938 transitions. Word has length 120 [2022-11-21 16:45:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:45:49,050 INFO L495 AbstractCegarLoop]: Abstraction has 7987 states and 10938 transitions. [2022-11-21 16:45:49,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-21 16:45:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 7987 states and 10938 transitions. [2022-11-21 16:45:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-21 16:45:49,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:45:49,054 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:45:49,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 16:45:49,055 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:45:49,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:45:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2053204873, now seen corresponding path program 1 times [2022-11-21 16:45:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:45:49,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823426724] [2022-11-21 16:45:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:45:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:45:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:45:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 16:45:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:45:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:45:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-21 16:45:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 16:45:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:45:49,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:45:49,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823426724] [2022-11-21 16:45:49,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823426724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:45:49,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:45:49,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-21 16:45:49,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899751712] [2022-11-21 16:45:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:45:49,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 16:45:49,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:45:49,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 16:45:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:45:49,969 INFO L87 Difference]: Start difference. First operand 7987 states and 10938 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-21 16:45:54,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:45:54,847 INFO L93 Difference]: Finished difference Result 15028 states and 21199 transitions. [2022-11-21 16:45:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 16:45:54,847 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 104 [2022-11-21 16:45:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:45:54,878 INFO L225 Difference]: With dead ends: 15028 [2022-11-21 16:45:54,878 INFO L226 Difference]: Without dead ends: 10127 [2022-11-21 16:45:54,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2022-11-21 16:45:54,895 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 577 mSDsluCounter, 5362 mSDsCounter, 0 mSdLazyCounter, 3033 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 6025 SdHoareTripleChecker+Invalid, 3327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 3033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:45:54,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 6025 Invalid, 3327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 3033 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-21 16:45:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10127 states. [2022-11-21 16:45:55,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10127 to 7133. [2022-11-21 16:45:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7133 states, 5203 states have (on average 1.2588891024408995) internal successors, (6550), 5251 states have internal predecessors, (6550), 1490 states have call successors, (1490), 403 states have call predecessors, (1490), 439 states have return successors, (1669), 1502 states have call predecessors, (1669), 1484 states have call successors, (1669) [2022-11-21 16:45:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 9709 transitions. [2022-11-21 16:45:55,834 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 9709 transitions. Word has length 104 [2022-11-21 16:45:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:45:55,835 INFO L495 AbstractCegarLoop]: Abstraction has 7133 states and 9709 transitions. [2022-11-21 16:45:55,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-21 16:45:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 9709 transitions. [2022-11-21 16:45:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-21 16:45:55,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:45:55,841 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:45:55,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 16:45:55,841 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:45:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:45:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1247847667, now seen corresponding path program 1 times [2022-11-21 16:45:55,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:45:55,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764064730] [2022-11-21 16:45:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:45:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:45:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:45:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 16:45:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 16:45:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:45:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:45:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:45:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:45:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:45:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 16:45:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:45:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-21 16:45:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-21 16:45:56,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:45:56,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764064730] [2022-11-21 16:45:56,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764064730] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:45:56,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559358497] [2022-11-21 16:45:56,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:45:56,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:45:56,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:45:56,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:45:56,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:45:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:45:57,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:45:57,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:45:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 16:45:57,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:45:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-21 16:45:57,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559358497] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:45:57,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:45:57,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2022-11-21 16:45:57,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843105760] [2022-11-21 16:45:57,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:45:57,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 16:45:57,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:45:57,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 16:45:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:45:57,557 INFO L87 Difference]: Start difference. First operand 7133 states and 9709 transitions. Second operand has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 9 states have internal predecessors, (111), 3 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-11-21 16:46:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:03,420 INFO L93 Difference]: Finished difference Result 14665 states and 19980 transitions. [2022-11-21 16:46:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 16:46:03,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 9 states have internal predecessors, (111), 3 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 111 [2022-11-21 16:46:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:03,449 INFO L225 Difference]: With dead ends: 14665 [2022-11-21 16:46:03,450 INFO L226 Difference]: Without dead ends: 7538 [2022-11-21 16:46:03,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:46:03,471 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 252 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:03,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 3092 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-21 16:46:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2022-11-21 16:46:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 7268. [2022-11-21 16:46:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7268 states, 5338 states have (on average 1.252341701011615) internal successors, (6685), 5383 states have internal predecessors, (6685), 1490 states have call successors, (1490), 403 states have call predecessors, (1490), 439 states have return successors, (1667), 1505 states have call predecessors, (1667), 1484 states have call successors, (1667) [2022-11-21 16:46:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 9842 transitions. [2022-11-21 16:46:04,305 INFO L78 Accepts]: Start accepts. Automaton has 7268 states and 9842 transitions. Word has length 111 [2022-11-21 16:46:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:04,306 INFO L495 AbstractCegarLoop]: Abstraction has 7268 states and 9842 transitions. [2022-11-21 16:46:04,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 9 states have internal predecessors, (111), 3 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-11-21 16:46:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 7268 states and 9842 transitions. [2022-11-21 16:46:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-21 16:46:04,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:04,311 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:46:04,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:04,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-21 16:46:04,522 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:04,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:04,522 INFO L85 PathProgramCache]: Analyzing trace with hash 800394672, now seen corresponding path program 1 times [2022-11-21 16:46:04,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:46:04,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471063770] [2022-11-21 16:46:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:04,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:46:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:04,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:46:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:04,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:46:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:04,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:46:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:04,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:46:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:46:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:46:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:46:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:46:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:46:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:46:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:46:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-21 16:46:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-21 16:46:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-21 16:46:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 16:46:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:46:05,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:46:05,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471063770] [2022-11-21 16:46:05,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471063770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:05,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:05,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-21 16:46:05,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928881090] [2022-11-21 16:46:05,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:05,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 16:46:05,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:46:05,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 16:46:05,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:46:05,419 INFO L87 Difference]: Start difference. First operand 7268 states and 9842 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-21 16:46:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:11,076 INFO L93 Difference]: Finished difference Result 13334 states and 18523 transitions. [2022-11-21 16:46:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 16:46:11,077 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) Word has length 121 [2022-11-21 16:46:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:11,114 INFO L225 Difference]: With dead ends: 13334 [2022-11-21 16:46:11,114 INFO L226 Difference]: Without dead ends: 10002 [2022-11-21 16:46:11,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-11-21 16:46:11,125 INFO L413 NwaCegarLoop]: 633 mSDtfsCounter, 680 mSDsluCounter, 4855 mSDsCounter, 0 mSdLazyCounter, 3207 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 5488 SdHoareTripleChecker+Invalid, 3685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 3207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:11,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 5488 Invalid, 3685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 3207 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-21 16:46:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10002 states. [2022-11-21 16:46:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10002 to 7266. [2022-11-21 16:46:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7266 states, 5338 states have (on average 1.2497189958786061) internal successors, (6671), 5381 states have internal predecessors, (6671), 1488 states have call successors, (1488), 403 states have call predecessors, (1488), 439 states have return successors, (1665), 1505 states have call predecessors, (1665), 1482 states have call successors, (1665) [2022-11-21 16:46:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7266 states to 7266 states and 9824 transitions. [2022-11-21 16:46:12,417 INFO L78 Accepts]: Start accepts. Automaton has 7266 states and 9824 transitions. Word has length 121 [2022-11-21 16:46:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:12,417 INFO L495 AbstractCegarLoop]: Abstraction has 7266 states and 9824 transitions. [2022-11-21 16:46:12,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-21 16:46:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7266 states and 9824 transitions. [2022-11-21 16:46:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-21 16:46:12,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:12,421 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:46:12,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 16:46:12,422 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1117139730, now seen corresponding path program 1 times [2022-11-21 16:46:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:46:12,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295109900] [2022-11-21 16:46:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:12,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:46:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:46:12,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:46:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:46:13,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:46:13,037 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:46:13,038 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 16:46:13,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 16:46:13,045 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:46:13,052 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:46:13,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:46:13 BoogieIcfgContainer [2022-11-21 16:46:13,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:46:13,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:46:13,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:46:13,237 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:46:13,238 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:44:17" (3/4) ... [2022-11-21 16:46:13,241 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:46:13,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:46:13,242 INFO L158 Benchmark]: Toolchain (without parser) took 121485.79ms. Allocated memory was 211.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 160.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 594.0MB. Max. memory is 16.1GB. [2022-11-21 16:46:13,243 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 138.4MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:46:13,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2016.35ms. Allocated memory is still 211.8MB. Free memory was 160.0MB in the beginning and 99.4MB in the end (delta: 60.6MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2022-11-21 16:46:13,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.75ms. Allocated memory is still 211.8MB. Free memory was 99.4MB in the beginning and 90.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-21 16:46:13,245 INFO L158 Benchmark]: Boogie Preprocessor took 132.32ms. Allocated memory is still 211.8MB. Free memory was 90.0MB in the beginning and 79.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 16:46:13,245 INFO L158 Benchmark]: RCFGBuilder took 3854.73ms. Allocated memory was 211.8MB in the beginning and 295.7MB in the end (delta: 83.9MB). Free memory was 79.5MB in the beginning and 211.3MB in the end (delta: -131.8MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2022-11-21 16:46:13,246 INFO L158 Benchmark]: TraceAbstraction took 115332.98ms. Allocated memory was 295.7MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 210.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 558.8MB. Max. memory is 16.1GB. [2022-11-21 16:46:13,254 INFO L158 Benchmark]: Witness Printer took 5.49ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:46:13,255 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 138.4MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2016.35ms. Allocated memory is still 211.8MB. Free memory was 160.0MB in the beginning and 99.4MB in the end (delta: 60.6MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 133.75ms. Allocated memory is still 211.8MB. Free memory was 99.4MB in the beginning and 90.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.32ms. Allocated memory is still 211.8MB. Free memory was 90.0MB in the beginning and 79.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 3854.73ms. Allocated memory was 211.8MB in the beginning and 295.7MB in the end (delta: 83.9MB). Free memory was 79.5MB in the beginning and 211.3MB in the end (delta: -131.8MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * TraceAbstraction took 115332.98ms. Allocated memory was 295.7MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 210.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 558.8MB. Max. memory is 16.1GB. * Witness Printer took 5.49ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 6104. Possible FailurePath: [L5149] static struct lock_class_key __key___7 ; [L5150] static struct lock_class_key __key___8 ; [L5290-L5303] static char const __mod_author31[46] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'S', (char const )'e', (char const )'b', (char const )'a', (char const )'s', (char const )'t', (char const )'i', (char const )'a', (char const )'n', (char const )' ', (char const )'H', (char const )'a', (char const )'a', (char const )'s', (char const )' ', (char const )'<', (char const )'h', (char const )'a', (char const )'a', (char const )'s', (char const )'@', (char const )'e', (char const )'m', (char const )'s', (char const )'-', (char const )'w', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )'.', (char const )'c', (char const )'o', (char const )'m', (char const )'>', (char const )'\000'}; [L5304-L5323] static char const __mod_description32[70] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'N', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )' ', (char const )'f', (char const )'o', (char const )'r', (char const )' ', (char const )'E', (char const )'M', (char const )'S', (char const )' ', (char const )'D', (char const )'r', (char const )'.', (char const )' ', (char const )'T', (char const )'h', (char const )'o', (char const )'m', (char const )'a', (char const )'s', (char const )' ', (char const )'W', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )' ', (char const )'C', (char const )'A', (char const )'N', (char const )'/', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'i', (char const )'n', (char const )'t', (char const )'e', (char const )'r', (char const )'f', (char const )'a', (char const )'c', (char const )'e', (char const )'s', (char const )'\000'}; [L5324-L5329] static char const __mod_license33[15] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )' ', (char const )'v', (char const )'2', (char const )'\000'}; [L5330-L5332] static struct usb_device_id ems_usb_table[1] = { {(__u16 )3, (__u16 )4822, (__u16 )1092, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6247-L6287] static struct net_device_ops const ems_usb_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & ems_usb_open, & ems_usb_close, & ems_usb_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , void *addr ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, (int (*)(struct net_device *dev , int new_mtu ))0, (int (*)(struct net_device *dev , struct neigh_parms * ))0, (void (*)(struct net_device *dev ))0, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6288-L6292] static struct can_bittiming_const ems_usb_bittiming_const = {{(char )'e', (char )'m', (char )'s', (char )'_', (char )'u', (char )'s', (char )'b', (char )'\000', (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}, (__u32 )1, (__u32 )16, (__u32 )1, (__u32 )8, (__u32 )4, (__u32 )1, (__u32 )64, (__u32 )1}; [L6543-L6561] static struct usb_driver ems_usb_driver = {"ems_usb", & ems_usb_probe, & ems_usb_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(ems_usb_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6614] int LDV_IN_INTERRUPT ; [L6615] static int res_ems_usb_open_10 ; [L6616] static int res_ems_usb_close_12 ; [L6617] static int res_ems_usb_probe_16 ; [L6767] int ldv_urb_state = 0; [L6768] int ldv_coherent_state = 0; VAL [__key___7={36:0}, __key___8={37:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6619] struct net_device *var_group1 ; [L6620] struct sk_buff *var_group2 ; [L6621] struct usb_interface *var_group3 ; [L6622] struct usb_device_id const *var_ems_usb_probe_16_p1 ; [L6623] int tmp___7 ; [L6624] int ldv_s_ems_usb_netdev_ops_net_device_ops ; [L6625] int ldv_s_ems_usb_driver_usb_driver ; [L6626] int tmp___8 ; [L6627] int tmp___9 ; [L6630] LDV_IN_INTERRUPT = 1 [L6631] FCALL ldv_initialize() [L6632] CALL, EXPR ems_usb_init() VAL [__key___7={36:0}, __key___8={37:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6565] int err ; [L6569] CALL, EXPR usb_register(& ems_usb_driver) [L5140] int tmp___7 ; [L5143] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L7025] return __VERIFIER_nondet_int(); [L5143] RET, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L5143] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb") [L5145] return (tmp___7); VAL [\result=0, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, driver={41:0}, driver={41:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6569] RET, EXPR usb_register(& ems_usb_driver) [L6569] err = usb_register(& ems_usb_driver) [L6571] COND FALSE !(\read(err)) [L6578] return (0); VAL [\result=0, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, err=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] RET, EXPR ems_usb_init() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_init()=0, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] tmp___7 = ems_usb_init() [L6634] COND FALSE !(\read(tmp___7)) [L6638] ldv_s_ems_usb_netdev_ops_net_device_ops = 0 [L6639] ldv_s_ems_usb_driver_usb_driver = 0 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6641] COND TRUE 1 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND TRUE \read(tmp___9) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___9=1] [L6655] tmp___8 = __VERIFIER_nondet_int() [L6657] COND FALSE !(tmp___8 == 0) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=1] [L6660] COND FALSE !(tmp___8 == 1) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=1] [L6663] COND TRUE tmp___8 == 2 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=1] [L6704] CALL ems_usb_start_xmit(var_group2, var_group1) [L6048] struct ems_usb *dev ; [L6049] void *tmp___7 ; [L6050] struct ems_tx_urb_context *context ; [L6051] struct net_device_stats *stats ; [L6052] struct can_frame *cf ; [L6053] struct ems_cpc_msg *msg ; [L6054] struct urb *urb ; [L6055] u8 *buf ; [L6056] int i ; [L6057] int err ; [L6058] size_t size ; [L6059] int tmp___8 ; [L6060] void *tmp___9 ; [L6061] unsigned int tmp___10 ; [L6062] int tmp___11 ; [L6063] long tmp___12 ; VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={18446744073709551623:0}, skb={18446744073709551623:0}] [L6066] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, dev={0:-521}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L4976] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [\result={0:-520}, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, dev={0:-521}, dev={0:-521}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6066] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={0:-521}, netdev={0:-521}, netdev_priv((struct net_device const *)netdev)={0:-520}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={18446744073709551623:0}, skb={18446744073709551623:0}] [L6066] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6067] dev = (struct ems_usb *)tmp___7 [L6068] context = (struct ems_tx_urb_context *)((void *)0) [L6069] stats = & netdev->stats [L6070] EXPR skb->data [L6070] cf = (struct can_frame *)skb->data [L6071] size = 15UL + sizeof(struct cpc_can_msg ) [L6072] CALL, EXPR can_dropped_invalid_skb(netdev, skb) [L5252] struct can_frame const *cf ; [L5253] int tmp___7 ; [L5254] long tmp___8 ; [L5256] EXPR skb->data [L5256] cf = (struct can_frame const *)((struct can_frame *)skb->data) [L5257] EXPR skb->len VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, cf={18446744073709551619:-8}, dev={0:-521}, dev={0:-521}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={18446744073709551623:0}, skb={18446744073709551623:0}, skb->len=4294967309] [L5257] COND FALSE !((unsigned long )skb->len != sizeof(*cf)) [L5260] EXPR cf->can_dlc VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, cf={18446744073709551619:-8}, cf->can_dlc=0, dev={0:-521}, dev={0:-521}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={18446744073709551623:0}, skb={18446744073709551623:0}] [L5260] COND FALSE !((int const )cf->can_dlc > 8) [L5263] tmp___7 = 0 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, cf={18446744073709551619:-8}, dev={0:-521}, dev={0:-521}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={18446744073709551623:0}, skb={18446744073709551623:0}, tmp___7=0] [L5266] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, cf={18446744073709551619:-8}, dev={0:-521}, dev={0:-521}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={18446744073709551623:0}, skb={18446744073709551623:0}, tmp___7=0, tmp___8=0] [L5268] COND FALSE !(\read(tmp___8)) [L5276] return (0); VAL [\result=0, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, cf={18446744073709551619:-8}, dev={0:-521}, dev={0:-521}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={18446744073709551623:0}, skb={18446744073709551623:0}, tmp___7=0, tmp___8=0] [L6072] RET, EXPR can_dropped_invalid_skb(netdev, skb) [L6072] tmp___8 = can_dropped_invalid_skb(netdev, skb) [L6074] COND FALSE !(\read(tmp___8)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0] [L6079] CALL, EXPR usb_alloc_urb(0, 32U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6830] void *arbitrary_memory ; [L6831] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6834] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6837] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, \old(size)=0, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-3:0}, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] return ldv_malloc(0UL); [L6837] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-3:0}, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6837] tmp___7 = ldv_undefined_pointer() [L6838] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, arbitrary_memory={-3:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7={-3:0}] [L6840] COND FALSE !(! arbitrary_memory) [L6844] ldv_urb_state = ldv_urb_state + 1 [L6845] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, \result={-3:0}, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, arbitrary_memory={-3:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7={-3:0}] [L6079] RET, EXPR usb_alloc_urb(0, 32U) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, usb_alloc_urb(0, 32U)={-3:0}] [L6079] urb = usb_alloc_urb(0, 32U) [L6081] COND FALSE !(! urb) [L6089] EXPR dev->udev VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551626:18446744073709551628}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, urb={-3:0}] [L6089] CALL, EXPR usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, dev={18446744073709551626:18446744073709551628}, dma={-3:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6773] void *arbitrary_memory ; [L6774] void *tmp___7 ; VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, dev={18446744073709551626:18446744073709551628}, dev={18446744073709551626:18446744073709551628}, dma={-3:104}, dma={-3:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6777] COND TRUE 1 VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, dev={18446744073709551626:18446744073709551628}, dev={18446744073709551626:18446744073709551628}, dma={-3:104}, dma={-3:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6780] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_coherent_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_coherent_state)=0, \old(size)=0, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_coherent_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-18446744073709551617:0}, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] return ldv_malloc(0UL); [L6780] RET, EXPR ldv_undefined_pointer() VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, dev={18446744073709551626:18446744073709551628}, dev={18446744073709551626:18446744073709551628}, dma={-3:104}, dma={-3:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-18446744073709551617:0}, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6780] tmp___7 = ldv_undefined_pointer() [L6781] arbitrary_memory = tmp___7 VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, arbitrary_memory={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551628}, dev={18446744073709551626:18446744073709551628}, dma={-3:104}, dma={-3:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, tmp___7={-18446744073709551617:0}] [L6783] COND FALSE !(! arbitrary_memory) [L6787] ldv_coherent_state = ldv_coherent_state + 1 [L6788] return (arbitrary_memory); VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, \result={-18446744073709551617:0}, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, arbitrary_memory={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551628}, dev={18446744073709551626:18446744073709551628}, dma={-3:104}, dma={-3:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, tmp___7={-18446744073709551617:0}] [L6089] RET, EXPR usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551626:18446744073709551628}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, urb={-3:0}, usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma)={-18446744073709551617:0}] [L6089] tmp___9 = usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) [L6090] buf = (u8 *)tmp___9 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6092] COND FALSE !(! buf) [L6100] msg = (struct ems_cpc_msg *)(buf + 4) [L6101] EXPR cf->can_id [L6101] msg->msg.can_msg.id = cf->can_id & 536870911U [L6102] EXPR cf->can_dlc [L6102] msg->msg.can_msg.length = cf->can_dlc [L6103] EXPR cf->can_id VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, cf->can_id=1, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6103] COND TRUE cf->can_id & 1073741824U [L6104] EXPR cf->can_id VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, cf->can_id=1, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6104] COND TRUE cf->can_id & 2147483648U [L6105] msg->type = (u8 )16 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6109] msg->length = (u8 )5 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6132] EXPR msg->msg.can_msg.id [L6132] msg->msg.can_msg.id = msg->msg.can_msg.id [L6133] i = 0 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6135] COND TRUE 1 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6137] COND TRUE i < 10 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6141] EXPR dev->tx_contexts[i].echo_index VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, dev->tx_contexts[i].echo_index=4294967306, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6141] COND TRUE dev->tx_contexts[i].echo_index == 10U [L6142] context = & dev->tx_contexts[i] VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6151] COND TRUE ! context VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6153] FCALL usb_unanchor_urb(urb) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6154] EXPR dev->udev [L6154] EXPR urb->transfer_dma VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551626:18446744073709551628}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}, urb->transfer_dma=18446744073709551627] [L6154] CALL usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma) VAL [\old(dma)=11, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551628}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6802] COND TRUE 1 VAL [\old(dma)=11, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551628}, dev={18446744073709551626:18446744073709551628}, dma=11, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6804] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0))) VAL [\old(dma)=11, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551628}, dev={18446744073709551626:18446744073709551628}, dma=11, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6810] COND TRUE \read(*addr) VAL [\old(dma)=11, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551628}, dev={18446744073709551626:18446744073709551628}, dma=11, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6811] COND TRUE ldv_coherent_state >= 1 VAL [\old(dma)=11, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551628}, dev={18446744073709551626:18446744073709551628}, dma=11, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6817] ldv_coherent_state = ldv_coherent_state - 1 VAL [\old(dma)=11, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551628}, dev={18446744073709551626:18446744073709551628}, dma=11, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6154] RET usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551626:18446744073709551628}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}, urb->transfer_dma=18446744073709551627] [L6155] netdev->dev.parent [L6157] return ((netdev_tx_t )16); VAL [\result=16, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, buf={-18446744073709551617:0}, cf={18446744073709551619:-8}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-521}, netdev={0:-521}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551623:0}, skb={18446744073709551623:0}, stats={0:-333}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}] [L6704] RET ems_usb_start_xmit(var_group2, var_group1) [L6641] COND TRUE 1 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=1, var_group1={0:-521}, var_group2={18446744073709551623:0}] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND FALSE !(\read(tmp___9)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-521}, var_group2={18446744073709551623:0}] [L6648] COND FALSE !(! (ldv_s_ems_usb_netdev_ops_net_device_ops == 0)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-521}, var_group2={18446744073709551623:0}] [L6650] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-521}, var_group2={18446744073709551623:0}] [L6742] CALL ems_usb_exit() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6587] FCALL usb_deregister(& ems_usb_driver) [L6742] RET ems_usb_exit() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-521}, var_group2={18446744073709551623:0}] [L6746] CALL ldv_check_final_state() [L6889] COND FALSE !(ldv_urb_state == 0) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6892] CALL ldv_blast_assert() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6754] reach_error() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551621:18446744073709551624}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 36 procedures, 432 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 115.1s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 84.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 17720 SdHoareTripleChecker+Valid, 68.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16456 mSDsluCounter, 87409 SdHoareTripleChecker+Invalid, 62.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71775 mSDsCounter, 7943 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44037 IncrementalHoareTripleChecker+Invalid, 51981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7943 mSolverCounterUnsat, 15634 mSDtfsCounter, 44037 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1287 GetRequests, 976 SyntacticMatches, 1 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8158occurred in iteration=21, InterpolantAutomatonStates: 264, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 27213 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 2500 NumberOfCodeBlocks, 2500 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2569 ConstructedInterpolants, 0 QuantifiedInterpolants, 5001 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4547 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 30 InterpolantComputations, 23 PerfectInterpolantSequences, 242/265 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 16:46:13,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a --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 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- 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-b5237d8 [2022-11-21 16:46:16,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:46:16,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:46:16,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:46:16,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:46:16,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:46:16,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:46:16,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:46:16,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:46:16,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:46:16,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:46:16,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:46:16,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:46:16,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:46:16,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:46:16,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:46:16,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:46:16,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:46:16,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:46:16,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:46:16,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:46:16,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:46:16,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:46:16,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:46:16,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:46:16,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:46:16,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:46:16,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:46:16,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:46:16,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:46:16,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:46:16,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:46:16,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:46:16,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:46:16,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:46:16,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:46:16,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:46:16,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:46:16,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:46:16,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:46:16,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:46:16,486 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-21 16:46:16,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:46:16,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:46:16,537 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:46:16,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:46:16,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:46:16,539 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:46:16,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:46:16,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:46:16,540 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:46:16,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:46:16,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:46:16,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:46:16,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:46:16,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:46:16,543 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:46:16,543 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 16:46:16,543 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 16:46:16,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:46:16,544 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:46:16,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:46:16,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:46:16,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:46:16,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:46:16,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:46:16,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:46:16,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:46:16,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:46:16,547 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 16:46:16,547 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 16:46:16,547 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:46:16,547 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:46:16,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:46:16,548 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 16:46:16,548 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/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_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a 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 -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2022-11-21 16:46:17,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:46:17,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:46:17,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:46:17,117 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:46:17,117 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:46:17,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-11-21 16:46:20,761 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:46:21,454 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:46:21,455 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-11-21 16:46:21,513 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/data/39ec0b712/6053492001fd4dc5964d1c81f8aa8d5e/FLAGbfcad2536 [2022-11-21 16:46:21,538 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/data/39ec0b712/6053492001fd4dc5964d1c81f8aa8d5e [2022-11-21 16:46:21,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:46:21,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:46:21,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:46:21,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:46:21,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:46:21,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:46:21" (1/1) ... [2022-11-21 16:46:21,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dea66ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:21, skipping insertion in model container [2022-11-21 16:46:21,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:46:21" (1/1) ... [2022-11-21 16:46:21,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:46:21,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:46:23,375 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2022-11-21 16:46:23,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:46:23,535 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-21 16:46:23,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:46:23,915 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2022-11-21 16:46:23,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:46:23,957 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:46:24,325 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2022-11-21 16:46:24,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:46:24,744 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:46:24,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24 WrapperNode [2022-11-21 16:46:24,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:46:24,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:46:24,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:46:24,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:46:24,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (1/1) ... [2022-11-21 16:46:24,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (1/1) ... [2022-11-21 16:46:24,980 INFO L138 Inliner]: procedures = 148, calls = 749, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1358 [2022-11-21 16:46:24,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:46:24,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:46:24,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:46:24,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:46:25,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (1/1) ... [2022-11-21 16:46:25,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (1/1) ... [2022-11-21 16:46:25,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (1/1) ... [2022-11-21 16:46:25,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (1/1) ... [2022-11-21 16:46:25,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (1/1) ... [2022-11-21 16:46:25,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (1/1) ... [2022-11-21 16:46:25,226 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (1/1) ... [2022-11-21 16:46:25,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (1/1) ... [2022-11-21 16:46:25,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:46:25,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:46:25,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:46:25,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:46:25,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (1/1) ... [2022-11-21 16:46:25,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:46:25,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:46:25,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:46:25,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:46:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-11-21 16:46:25,392 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-11-21 16:46:25,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-21 16:46:25,394 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2022-11-21 16:46:25,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2022-11-21 16:46:25,395 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-11-21 16:46:25,396 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-11-21 16:46:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-21 16:46:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-21 16:46:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-21 16:46:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-21 16:46:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-21 16:46:25,397 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-21 16:46:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2022-11-21 16:46:25,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2022-11-21 16:46:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-21 16:46:25,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-21 16:46:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-21 16:46:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-21 16:46:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2022-11-21 16:46:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2022-11-21 16:46:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2022-11-21 16:46:25,400 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2022-11-21 16:46:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-21 16:46:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-21 16:46:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2022-11-21 16:46:25,402 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2022-11-21 16:46:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-11-21 16:46:25,403 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-11-21 16:46:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-21 16:46:25,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-21 16:46:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-11-21 16:46:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-11-21 16:46:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-11-21 16:46:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-11-21 16:46:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-11-21 16:46:25,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-11-21 16:46:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-21 16:46:25,407 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-21 16:46:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2022-11-21 16:46:25,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2022-11-21 16:46:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:46:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2022-11-21 16:46:25,408 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2022-11-21 16:46:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:46:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-11-21 16:46:25,408 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-11-21 16:46:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:46:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:46:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-11-21 16:46:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2022-11-21 16:46:25,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2022-11-21 16:46:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-11-21 16:46:25,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-11-21 16:46:25,412 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-21 16:46:25,412 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-21 16:46:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-11-21 16:46:25,414 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-11-21 16:46:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:46:25,415 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-11-21 16:46:25,415 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-11-21 16:46:25,415 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-21 16:46:25,416 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-21 16:46:25,416 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2022-11-21 16:46:25,416 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2022-11-21 16:46:25,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-21 16:46:25,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-11-21 16:46:25,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-21 16:46:25,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-21 16:46:25,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:46:25,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 16:46:25,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:46:25,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-11-21 16:46:25,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 16:46:25,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-21 16:46:25,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-11-21 16:46:25,419 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-21 16:46:25,420 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-21 16:46:25,420 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2022-11-21 16:46:25,421 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2022-11-21 16:46:25,421 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-21 16:46:25,421 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-21 16:46:25,421 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2022-11-21 16:46:25,422 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2022-11-21 16:46:25,422 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-21 16:46:25,422 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-21 16:46:25,422 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-21 16:46:25,423 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-21 16:46:25,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-21 16:46:25,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-21 16:46:25,423 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-11-21 16:46:25,423 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-11-21 16:46:25,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-11-21 16:46:25,424 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-11-21 16:46:25,424 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-11-21 16:46:25,424 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-11-21 16:46:25,425 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-11-21 16:46:25,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:46:25,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:46:25,965 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:46:25,970 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:46:28,566 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-21 16:46:30,987 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-21 16:46:40,919 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-11-21 16:46:40,920 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-11-21 16:46:41,057 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:46:41,082 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:46:41,082 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-11-21 16:46:41,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:46:41 BoogieIcfgContainer [2022-11-21 16:46:41,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:46:41,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:46:41,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:46:41,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:46:41,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:46:21" (1/3) ... [2022-11-21 16:46:41,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec2ae6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:46:41, skipping insertion in model container [2022-11-21 16:46:41,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:24" (2/3) ... [2022-11-21 16:46:41,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec2ae6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:46:41, skipping insertion in model container [2022-11-21 16:46:41,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:46:41" (3/3) ... [2022-11-21 16:46:41,110 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-11-21 16:46:41,134 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:46:41,135 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:46:41,252 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:46:41,262 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;@2256f52a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:46:41,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:46:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 431 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 316 states have internal predecessors, (411), 91 states have call successors, (91), 35 states have call predecessors, (91), 34 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2022-11-21 16:46:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:46:41,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:41,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:46:41,285 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:41,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1517292025, now seen corresponding path program 1 times [2022-11-21 16:46:41,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:46:41,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352985506] [2022-11-21 16:46:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:41,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:46:41,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:46:41,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-21 16:46:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:42,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:46:42,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:42,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:46:42,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:46:42,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352985506] [2022-11-21 16:46:42,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352985506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:42,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:42,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:46:42,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198443316] [2022-11-21 16:46:42,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:42,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:46:42,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:46:42,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:46:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:46:42,481 INFO L87 Difference]: Start difference. First operand has 431 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 316 states have internal predecessors, (411), 91 states have call successors, (91), 35 states have call predecessors, (91), 34 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:46:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:42,805 INFO L93 Difference]: Finished difference Result 1253 states and 1768 transitions. [2022-11-21 16:46:42,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:46:42,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-21 16:46:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:42,838 INFO L225 Difference]: With dead ends: 1253 [2022-11-21 16:46:42,838 INFO L226 Difference]: Without dead ends: 824 [2022-11-21 16:46:42,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:46:42,857 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 539 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:42,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:46:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-11-21 16:46:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2022-11-21 16:46:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 581 states have (on average 1.2581755593803787) internal successors, (731), 593 states have internal predecessors, (731), 173 states have call successors, (173), 66 states have call predecessors, (173), 65 states have return successors, (172), 165 states have call predecessors, (172), 169 states have call successors, (172) [2022-11-21 16:46:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1076 transitions. [2022-11-21 16:46:43,066 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1076 transitions. Word has length 16 [2022-11-21 16:46:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:43,067 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1076 transitions. [2022-11-21 16:46:43,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:46:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1076 transitions. [2022-11-21 16:46:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:46:43,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:43,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:46:43,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:43,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:43,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash 208359179, now seen corresponding path program 1 times [2022-11-21 16:46:43,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:46:43,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101415846] [2022-11-21 16:46:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:43,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:43,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:46:43,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:46:43,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-21 16:46:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:44,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:46:44,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:44,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:46:44,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:46:44,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101415846] [2022-11-21 16:46:44,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101415846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:44,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:44,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:46:44,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934200728] [2022-11-21 16:46:44,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:44,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:46:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:46:44,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:46:44,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:46:44,330 INFO L87 Difference]: Start difference. First operand 820 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:46:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:44,587 INFO L93 Difference]: Finished difference Result 2433 states and 3207 transitions. [2022-11-21 16:46:44,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:46:44,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-21 16:46:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:44,613 INFO L225 Difference]: With dead ends: 2433 [2022-11-21 16:46:44,613 INFO L226 Difference]: Without dead ends: 1617 [2022-11-21 16:46:44,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:46:44,620 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 529 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:44,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:46:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2022-11-21 16:46:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1610. [2022-11-21 16:46:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1141 states have (on average 1.2541630148992111) internal successors, (1431), 1160 states have internal predecessors, (1431), 340 states have call successors, (340), 129 states have call predecessors, (340), 128 states have return successors, (346), 328 states have call predecessors, (346), 336 states have call successors, (346) [2022-11-21 16:46:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2022-11-21 16:46:44,811 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 17 [2022-11-21 16:46:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:44,812 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2022-11-21 16:46:44,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:46:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2022-11-21 16:46:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 16:46:44,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:44,826 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:46:44,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:45,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:45,050 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:45,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash 26582145, now seen corresponding path program 1 times [2022-11-21 16:46:45,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:46:45,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020824553] [2022-11-21 16:46:45,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:45,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:45,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:46:45,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:46:45,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-21 16:46:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:45,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:46:45,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:46:46,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:46:46,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:46:46,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020824553] [2022-11-21 16:46:46,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020824553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:46,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:46,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:46:46,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874922046] [2022-11-21 16:46:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:46,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:46:46,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:46:46,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:46:46,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:46:46,107 INFO L87 Difference]: Start difference. First operand 1610 states and 2117 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:46:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:46,288 INFO L93 Difference]: Finished difference Result 3212 states and 4225 transitions. [2022-11-21 16:46:46,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:46:46,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-11-21 16:46:46,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:46,300 INFO L225 Difference]: With dead ends: 3212 [2022-11-21 16:46:46,300 INFO L226 Difference]: Without dead ends: 1610 [2022-11-21 16:46:46,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:46:46,307 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:46,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2178 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:46:46,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2022-11-21 16:46:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2022-11-21 16:46:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1141 states have (on average 1.2532865907099036) internal successors, (1430), 1160 states have internal predecessors, (1430), 340 states have call successors, (340), 129 states have call predecessors, (340), 128 states have return successors, (346), 328 states have call predecessors, (346), 336 states have call successors, (346) [2022-11-21 16:46:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2116 transitions. [2022-11-21 16:46:46,474 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2116 transitions. Word has length 71 [2022-11-21 16:46:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:46,475 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2116 transitions. [2022-11-21 16:46:46,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:46:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2116 transitions. [2022-11-21 16:46:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 16:46:46,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:46,482 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:46:46,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-21 16:46:46,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:46,708 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2146869344, now seen corresponding path program 1 times [2022-11-21 16:46:46,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:46:46,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130844318] [2022-11-21 16:46:46,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:46,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:46,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:46:46,713 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:46:46,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-21 16:46:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:47,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:46:47,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:46:47,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:46:47,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:46:47,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130844318] [2022-11-21 16:46:47,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130844318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:47,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:47,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:46:47,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2706862] [2022-11-21 16:46:47,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:47,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:46:47,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:46:47,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:46:47,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:46:47,700 INFO L87 Difference]: Start difference. First operand 1610 states and 2116 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:46:47,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:47,997 INFO L93 Difference]: Finished difference Result 3924 states and 5357 transitions. [2022-11-21 16:46:47,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:46:47,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-11-21 16:46:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:48,013 INFO L225 Difference]: With dead ends: 3924 [2022-11-21 16:46:48,013 INFO L226 Difference]: Without dead ends: 2325 [2022-11-21 16:46:48,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:46:48,024 INFO L413 NwaCegarLoop]: 629 mSDtfsCounter, 206 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:48,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1122 Invalid, 15 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:46:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-11-21 16:46:48,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2313. [2022-11-21 16:46:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 1640 states have (on average 1.2939024390243903) internal successors, (2122), 1675 states have internal predecessors, (2122), 544 states have call successors, (544), 129 states have call predecessors, (544), 128 states have return successors, (558), 524 states have call predecessors, (558), 540 states have call successors, (558) [2022-11-21 16:46:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3224 transitions. [2022-11-21 16:46:48,202 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3224 transitions. Word has length 71 [2022-11-21 16:46:48,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:48,202 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3224 transitions. [2022-11-21 16:46:48,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:46:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3224 transitions. [2022-11-21 16:46:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 16:46:48,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:48,207 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:46:48,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:48,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:48,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569613, now seen corresponding path program 1 times [2022-11-21 16:46:48,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:46:48,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873628078] [2022-11-21 16:46:48,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:48,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:46:48,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:46:48,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-21 16:46:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:49,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:46:49,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:49,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:46:49,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:46:49,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873628078] [2022-11-21 16:46:49,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873628078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:49,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:49,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:46:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454684554] [2022-11-21 16:46:49,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:49,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:46:49,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:46:49,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:46:49,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:46:49,465 INFO L87 Difference]: Start difference. First operand 2313 states and 3224 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:46:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:50,311 INFO L93 Difference]: Finished difference Result 6261 states and 9014 transitions. [2022-11-21 16:46:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:46:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-11-21 16:46:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:50,340 INFO L225 Difference]: With dead ends: 6261 [2022-11-21 16:46:50,340 INFO L226 Difference]: Without dead ends: 3960 [2022-11-21 16:46:50,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:46:50,351 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 447 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:50,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 2062 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:46:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2022-11-21 16:46:50,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 2329. [2022-11-21 16:46:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 1656 states have (on average 1.291062801932367) internal successors, (2138), 1691 states have internal predecessors, (2138), 544 states have call successors, (544), 129 states have call predecessors, (544), 128 states have return successors, (558), 524 states have call predecessors, (558), 540 states have call successors, (558) [2022-11-21 16:46:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3240 transitions. [2022-11-21 16:46:50,691 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3240 transitions. Word has length 68 [2022-11-21 16:46:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:50,692 INFO L495 AbstractCegarLoop]: Abstraction has 2329 states and 3240 transitions. [2022-11-21 16:46:50,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:46:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3240 transitions. [2022-11-21 16:46:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 16:46:50,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:50,696 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:46:50,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:50,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:50,912 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:50,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1776712988, now seen corresponding path program 1 times [2022-11-21 16:46:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:46:50,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354219864] [2022-11-21 16:46:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:50,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:50,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:46:50,916 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:46:50,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-21 16:46:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:51,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:46:51,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:51,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:46:51,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:46:51,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354219864] [2022-11-21 16:46:51,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354219864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:51,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:51,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:46:51,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924915234] [2022-11-21 16:46:51,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:51,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:46:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:46:51,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:46:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:46:51,850 INFO L87 Difference]: Start difference. First operand 2329 states and 3240 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:46:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:52,527 INFO L93 Difference]: Finished difference Result 5821 states and 8310 transitions. [2022-11-21 16:46:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:46:52,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-11-21 16:46:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:52,550 INFO L225 Difference]: With dead ends: 5821 [2022-11-21 16:46:52,550 INFO L226 Difference]: Without dead ends: 3504 [2022-11-21 16:46:52,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:46:52,560 INFO L413 NwaCegarLoop]: 823 mSDtfsCounter, 336 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:52,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 2023 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:46:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2022-11-21 16:46:52,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 2345. [2022-11-21 16:46:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 1672 states have (on average 1.2882775119617225) internal successors, (2154), 1707 states have internal predecessors, (2154), 544 states have call successors, (544), 129 states have call predecessors, (544), 128 states have return successors, (558), 524 states have call predecessors, (558), 540 states have call successors, (558) [2022-11-21 16:46:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3256 transitions. [2022-11-21 16:46:52,853 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3256 transitions. Word has length 69 [2022-11-21 16:46:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:52,854 INFO L495 AbstractCegarLoop]: Abstraction has 2345 states and 3256 transitions. [2022-11-21 16:46:52,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:46:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3256 transitions. [2022-11-21 16:46:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 16:46:52,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:52,857 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:46:52,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:53,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:53,081 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:53,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:53,082 INFO L85 PathProgramCache]: Analyzing trace with hash 676145405, now seen corresponding path program 1 times [2022-11-21 16:46:53,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:46:53,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117823822] [2022-11-21 16:46:53,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:53,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:53,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:46:53,085 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:46:53,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-21 16:46:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:53,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 16:46:53,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:54,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:46:54,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:46:54,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117823822] [2022-11-21 16:46:54,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117823822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:54,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:54,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:46:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333302348] [2022-11-21 16:46:54,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:54,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:46:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:46:54,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:46:54,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:46:54,386 INFO L87 Difference]: Start difference. First operand 2345 states and 3256 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:46:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:54,828 INFO L93 Difference]: Finished difference Result 3553 states and 4967 transitions. [2022-11-21 16:46:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:46:54,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-11-21 16:46:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:54,843 INFO L225 Difference]: With dead ends: 3553 [2022-11-21 16:46:54,843 INFO L226 Difference]: Without dead ends: 2377 [2022-11-21 16:46:54,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:46:54,849 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 2 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:54,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3254 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:46:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-11-21 16:46:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2377. [2022-11-21 16:46:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 1694 states have (on average 1.2845336481700118) internal successors, (2176), 1731 states have internal predecessors, (2176), 544 states have call successors, (544), 129 states have call predecessors, (544), 138 states have return successors, (592), 532 states have call predecessors, (592), 540 states have call successors, (592) [2022-11-21 16:46:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3312 transitions. [2022-11-21 16:46:55,181 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3312 transitions. Word has length 69 [2022-11-21 16:46:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:55,184 INFO L495 AbstractCegarLoop]: Abstraction has 2377 states and 3312 transitions. [2022-11-21 16:46:55,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:46:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3312 transitions. [2022-11-21 16:46:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 16:46:55,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:55,188 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:46:55,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:55,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:55,403 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958436, now seen corresponding path program 1 times [2022-11-21 16:46:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:46:55,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419196667] [2022-11-21 16:46:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:55,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:55,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:46:55,406 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:46:55,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-21 16:46:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:56,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 16:46:56,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:56,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:46:56,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:46:56,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419196667] [2022-11-21 16:46:56,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419196667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:56,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:56,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:46:56,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962897938] [2022-11-21 16:46:56,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:56,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:46:56,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:46:56,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:46:56,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:46:56,605 INFO L87 Difference]: Start difference. First operand 2377 states and 3312 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:46:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:58,213 INFO L93 Difference]: Finished difference Result 5537 states and 7892 transitions. [2022-11-21 16:46:58,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:46:58,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-11-21 16:46:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:58,233 INFO L225 Difference]: With dead ends: 5537 [2022-11-21 16:46:58,233 INFO L226 Difference]: Without dead ends: 3172 [2022-11-21 16:46:58,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:46:58,243 INFO L413 NwaCegarLoop]: 909 mSDtfsCounter, 217 mSDsluCounter, 6881 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 7790 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:58,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 7790 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 16:46:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2022-11-21 16:46:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 2381. [2022-11-21 16:46:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 1698 states have (on average 1.28150765606596) internal successors, (2176), 1733 states have internal predecessors, (2176), 544 states have call successors, (544), 129 states have call predecessors, (544), 138 states have return successors, (592), 534 states have call predecessors, (592), 540 states have call successors, (592) [2022-11-21 16:46:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3312 transitions. [2022-11-21 16:46:58,541 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3312 transitions. Word has length 69 [2022-11-21 16:46:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:58,542 INFO L495 AbstractCegarLoop]: Abstraction has 2381 states and 3312 transitions. [2022-11-21 16:46:58,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:46:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3312 transitions. [2022-11-21 16:46:58,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-21 16:46:58,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:58,549 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:46:58,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:58,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:58,762 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:58,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1395829828, now seen corresponding path program 1 times [2022-11-21 16:46:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:46:58,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147397407] [2022-11-21 16:46:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:58,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:46:58,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:46:58,766 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:46:58,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-21 16:46:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:59,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:46:59,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:59,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:46:59,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:46:59,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147397407] [2022-11-21 16:46:59,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147397407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:59,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:59,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:46:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620036732] [2022-11-21 16:46:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:59,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:46:59,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:46:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:46:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:46:59,718 INFO L87 Difference]: Start difference. First operand 2381 states and 3312 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:47:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:00,436 INFO L93 Difference]: Finished difference Result 5691 states and 8110 transitions. [2022-11-21 16:47:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:47:00,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-11-21 16:47:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:00,462 INFO L225 Difference]: With dead ends: 5691 [2022-11-21 16:47:00,463 INFO L226 Difference]: Without dead ends: 3322 [2022-11-21 16:47:00,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:47:00,474 INFO L413 NwaCegarLoop]: 826 mSDtfsCounter, 168 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:00,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 3056 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:47:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2022-11-21 16:47:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 2171. [2022-11-21 16:47:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 1554 states have (on average 1.2715572715572716) internal successors, (1976), 1573 states have internal predecessors, (1976), 480 states have call successors, (480), 127 states have call predecessors, (480), 136 states have return successors, (526), 478 states have call predecessors, (526), 476 states have call successors, (526) [2022-11-21 16:47:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2982 transitions. [2022-11-21 16:47:00,808 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2982 transitions. Word has length 75 [2022-11-21 16:47:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:00,808 INFO L495 AbstractCegarLoop]: Abstraction has 2171 states and 2982 transitions. [2022-11-21 16:47:00,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:47:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2982 transitions. [2022-11-21 16:47:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-21 16:47:00,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:00,811 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:47:00,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:01,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:01,034 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:01,035 INFO L85 PathProgramCache]: Analyzing trace with hash -506709307, now seen corresponding path program 1 times [2022-11-21 16:47:01,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:47:01,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111347791] [2022-11-21 16:47:01,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:01,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:01,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:47:01,043 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:47:01,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-21 16:47:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:01,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:47:01,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:47:02,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:47:02,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:47:02,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111347791] [2022-11-21 16:47:02,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111347791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:02,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:02,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:47:02,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564953452] [2022-11-21 16:47:02,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:02,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:47:02,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:47:02,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:47:02,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:47:02,543 INFO L87 Difference]: Start difference. First operand 2171 states and 2982 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-21 16:47:05,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:47:10,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:47:13,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:47:14,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:47:15,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:47:22,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:47:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:28,335 INFO L93 Difference]: Finished difference Result 5585 states and 7755 transitions. [2022-11-21 16:47:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:47:28,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2022-11-21 16:47:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:28,364 INFO L225 Difference]: With dead ends: 5585 [2022-11-21 16:47:28,364 INFO L226 Difference]: Without dead ends: 4375 [2022-11-21 16:47:28,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:47:28,371 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 1135 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 326 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:28,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 2009 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 2075 Invalid, 2 Unknown, 0 Unchecked, 25.1s Time] [2022-11-21 16:47:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4375 states. [2022-11-21 16:47:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4375 to 4317. [2022-11-21 16:47:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 3092 states have (on average 1.2739327296248384) internal successors, (3939), 3127 states have internal predecessors, (3939), 954 states have call successors, (954), 249 states have call predecessors, (954), 270 states have return successors, (1082), 960 states have call predecessors, (1082), 950 states have call successors, (1082) [2022-11-21 16:47:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 5975 transitions. [2022-11-21 16:47:29,014 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 5975 transitions. Word has length 75 [2022-11-21 16:47:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:29,016 INFO L495 AbstractCegarLoop]: Abstraction has 4317 states and 5975 transitions. [2022-11-21 16:47:29,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-21 16:47:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 5975 transitions. [2022-11-21 16:47:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-21 16:47:29,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:29,022 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:47:29,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:29,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:29,236 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash -9266808, now seen corresponding path program 1 times [2022-11-21 16:47:29,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:47:29,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035396696] [2022-11-21 16:47:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:29,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:29,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:47:29,241 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:47:29,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-21 16:47:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:30,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:47:30,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:47:30,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:47:30,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:47:30,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035396696] [2022-11-21 16:47:30,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035396696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:30,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:30,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:47:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39622320] [2022-11-21 16:47:30,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:30,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:47:30,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:47:30,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:47:30,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:47:30,295 INFO L87 Difference]: Start difference. First operand 4317 states and 5975 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 16:47:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:30,725 INFO L93 Difference]: Finished difference Result 8632 states and 12090 transitions. [2022-11-21 16:47:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:47:30,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2022-11-21 16:47:30,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:30,758 INFO L225 Difference]: With dead ends: 8632 [2022-11-21 16:47:30,758 INFO L226 Difference]: Without dead ends: 4327 [2022-11-21 16:47:30,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:47:30,780 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:30,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1088 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:47:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4327 states. [2022-11-21 16:47:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4327 to 4327. [2022-11-21 16:47:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 3102 states have (on average 1.2730496453900708) internal successors, (3949), 3137 states have internal predecessors, (3949), 954 states have call successors, (954), 249 states have call predecessors, (954), 270 states have return successors, (1082), 960 states have call predecessors, (1082), 950 states have call successors, (1082) [2022-11-21 16:47:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5985 transitions. [2022-11-21 16:47:31,398 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5985 transitions. Word has length 94 [2022-11-21 16:47:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:31,398 INFO L495 AbstractCegarLoop]: Abstraction has 4327 states and 5985 transitions. [2022-11-21 16:47:31,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 16:47:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5985 transitions. [2022-11-21 16:47:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-21 16:47:31,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:31,403 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:47:31,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:31,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:31,630 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:31,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1858805077, now seen corresponding path program 1 times [2022-11-21 16:47:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:47:31,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639487972] [2022-11-21 16:47:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:31,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:31,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:47:31,633 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:47:31,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-21 16:47:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:32,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:47:32,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:47:32,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:47:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:47:32,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:47:32,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639487972] [2022-11-21 16:47:32,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639487972] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:47:32,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:47:32,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-21 16:47:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995542063] [2022-11-21 16:47:32,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:47:32,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:47:32,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:47:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:47:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:47:32,869 INFO L87 Difference]: Start difference. First operand 4327 states and 5985 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-21 16:47:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:33,645 INFO L93 Difference]: Finished difference Result 8672 states and 12150 transitions. [2022-11-21 16:47:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:47:33,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 95 [2022-11-21 16:47:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:33,688 INFO L225 Difference]: With dead ends: 8672 [2022-11-21 16:47:33,688 INFO L226 Difference]: Without dead ends: 4357 [2022-11-21 16:47:33,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:47:33,702 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 0 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:33,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2717 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:47:33,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2022-11-21 16:47:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 4357. [2022-11-21 16:47:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4357 states, 3132 states have (on average 1.2704342273307792) internal successors, (3979), 3167 states have internal predecessors, (3979), 954 states have call successors, (954), 249 states have call predecessors, (954), 270 states have return successors, (1082), 960 states have call predecessors, (1082), 950 states have call successors, (1082) [2022-11-21 16:47:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4357 states to 4357 states and 6015 transitions. [2022-11-21 16:47:34,162 INFO L78 Accepts]: Start accepts. Automaton has 4357 states and 6015 transitions. Word has length 95 [2022-11-21 16:47:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:34,163 INFO L495 AbstractCegarLoop]: Abstraction has 4357 states and 6015 transitions. [2022-11-21 16:47:34,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-21 16:47:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4357 states and 6015 transitions. [2022-11-21 16:47:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-21 16:47:34,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:34,168 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-11-21 16:47:34,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:34,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:34,382 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:34,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:34,383 INFO L85 PathProgramCache]: Analyzing trace with hash 989690663, now seen corresponding path program 1 times [2022-11-21 16:47:34,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:47:34,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332128739] [2022-11-21 16:47:34,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:34,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:34,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:47:34,385 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:47:34,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-21 16:47:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:35,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:47:35,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 16:47:35,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:47:35,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:47:35,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332128739] [2022-11-21 16:47:35,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332128739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:35,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:35,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:47:35,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5700071] [2022-11-21 16:47:35,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:35,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:47:35,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:47:35,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:47:35,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:47:35,475 INFO L87 Difference]: Start difference. First operand 4357 states and 6015 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:47:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:37,628 INFO L93 Difference]: Finished difference Result 9869 states and 13936 transitions. [2022-11-21 16:47:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:47:37,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2022-11-21 16:47:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:37,654 INFO L225 Difference]: With dead ends: 9869 [2022-11-21 16:47:37,654 INFO L226 Difference]: Without dead ends: 5524 [2022-11-21 16:47:37,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:47:37,670 INFO L413 NwaCegarLoop]: 822 mSDtfsCounter, 173 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:37,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 3044 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-21 16:47:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2022-11-21 16:47:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 3695. [2022-11-21 16:47:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3695 states, 2682 states have (on average 1.267710663683818) internal successors, (3400), 2699 states have internal predecessors, (3400), 788 states have call successors, (788), 205 states have call predecessors, (788), 224 states have return successors, (898), 810 states have call predecessors, (898), 784 states have call successors, (898) [2022-11-21 16:47:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 5086 transitions. [2022-11-21 16:47:38,123 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 5086 transitions. Word has length 98 [2022-11-21 16:47:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:38,124 INFO L495 AbstractCegarLoop]: Abstraction has 3695 states and 5086 transitions. [2022-11-21 16:47:38,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:47:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 5086 transitions. [2022-11-21 16:47:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-21 16:47:38,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:38,128 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:47:38,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:38,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:38,342 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1871827029, now seen corresponding path program 1 times [2022-11-21 16:47:38,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:47:38,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033498141] [2022-11-21 16:47:38,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:38,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:38,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:47:38,346 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:47:38,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-21 16:47:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:39,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 16:47:39,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:47:39,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:47:39,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:47:39,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033498141] [2022-11-21 16:47:39,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033498141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:39,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:39,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:47:39,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762220171] [2022-11-21 16:47:39,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:39,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:47:39,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:47:39,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:47:39,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:47:39,739 INFO L87 Difference]: Start difference. First operand 3695 states and 5086 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:47:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:40,736 INFO L93 Difference]: Finished difference Result 8437 states and 11958 transitions. [2022-11-21 16:47:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:47:40,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2022-11-21 16:47:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:40,767 INFO L225 Difference]: With dead ends: 8437 [2022-11-21 16:47:40,767 INFO L226 Difference]: Without dead ends: 5178 [2022-11-21 16:47:40,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:47:40,782 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 168 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:40,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 3060 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:47:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2022-11-21 16:47:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 3511. [2022-11-21 16:47:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 2554 states have (on average 1.2623335943617855) internal successors, (3224), 2559 states have internal predecessors, (3224), 732 states have call successors, (732), 203 states have call predecessors, (732), 224 states have return successors, (848), 764 states have call predecessors, (848), 728 states have call successors, (848) [2022-11-21 16:47:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 4804 transitions. [2022-11-21 16:47:41,328 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 4804 transitions. Word has length 87 [2022-11-21 16:47:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:41,329 INFO L495 AbstractCegarLoop]: Abstraction has 3511 states and 4804 transitions. [2022-11-21 16:47:41,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:47:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 4804 transitions. [2022-11-21 16:47:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-21 16:47:41,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:41,333 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:47:41,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:41,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:41,559 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash -205382314, now seen corresponding path program 1 times [2022-11-21 16:47:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:47:41,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631251564] [2022-11-21 16:47:41,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:41,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:41,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:47:41,563 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:47:41,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-21 16:47:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:42,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 16:47:42,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:47:42,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:47:42,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:47:42,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631251564] [2022-11-21 16:47:42,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631251564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:42,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:42,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:47:42,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647590898] [2022-11-21 16:47:42,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:42,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:47:42,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:47:42,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:47:42,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:47:42,901 INFO L87 Difference]: Start difference. First operand 3511 states and 4804 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 16:47:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:43,310 INFO L93 Difference]: Finished difference Result 5178 states and 7121 transitions. [2022-11-21 16:47:43,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:47:43,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2022-11-21 16:47:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:43,324 INFO L225 Difference]: With dead ends: 5178 [2022-11-21 16:47:43,325 INFO L226 Difference]: Without dead ends: 3519 [2022-11-21 16:47:43,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:47:43,330 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 2 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3248 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:43,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3248 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:47:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2022-11-21 16:47:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3519. [2022-11-21 16:47:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3519 states, 2562 states have (on average 1.2615144418423108) internal successors, (3232), 2563 states have internal predecessors, (3232), 732 states have call successors, (732), 203 states have call predecessors, (732), 224 states have return successors, (848), 768 states have call predecessors, (848), 728 states have call successors, (848) [2022-11-21 16:47:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 3519 states and 4812 transitions. [2022-11-21 16:47:43,792 INFO L78 Accepts]: Start accepts. Automaton has 3519 states and 4812 transitions. Word has length 87 [2022-11-21 16:47:43,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:43,793 INFO L495 AbstractCegarLoop]: Abstraction has 3519 states and 4812 transitions. [2022-11-21 16:47:43,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 16:47:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3519 states and 4812 transitions. [2022-11-21 16:47:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-21 16:47:43,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:43,797 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:47:43,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:44,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:44,019 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2079481141, now seen corresponding path program 1 times [2022-11-21 16:47:44,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:47:44,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825425294] [2022-11-21 16:47:44,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:44,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:44,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:47:44,023 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:47:44,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-21 16:47:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:44,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:47:44,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:47:44,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:47:44,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:47:44,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825425294] [2022-11-21 16:47:44,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825425294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:44,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:44,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:47:44,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469961771] [2022-11-21 16:47:44,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:44,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:47:44,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:47:44,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:47:44,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:47:44,813 INFO L87 Difference]: Start difference. First operand 3519 states and 4812 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:47:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:45,506 INFO L93 Difference]: Finished difference Result 6181 states and 8680 transitions. [2022-11-21 16:47:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:47:45,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2022-11-21 16:47:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:45,525 INFO L225 Difference]: With dead ends: 6181 [2022-11-21 16:47:45,525 INFO L226 Difference]: Without dead ends: 4518 [2022-11-21 16:47:45,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:47:45,532 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 197 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:45,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1448 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:47:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2022-11-21 16:47:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3527. [2022-11-21 16:47:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3527 states, 2570 states have (on average 1.2607003891050583) internal successors, (3240), 2571 states have internal predecessors, (3240), 732 states have call successors, (732), 203 states have call predecessors, (732), 224 states have return successors, (848), 768 states have call predecessors, (848), 728 states have call successors, (848) [2022-11-21 16:47:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 4820 transitions. [2022-11-21 16:47:46,033 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 4820 transitions. Word has length 87 [2022-11-21 16:47:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:46,033 INFO L495 AbstractCegarLoop]: Abstraction has 3527 states and 4820 transitions. [2022-11-21 16:47:46,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:47:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 4820 transitions. [2022-11-21 16:47:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-21 16:47:46,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:46,037 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:47:46,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:46,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:46,250 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:46,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:46,251 INFO L85 PathProgramCache]: Analyzing trace with hash 390816807, now seen corresponding path program 1 times [2022-11-21 16:47:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:47:46,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129045462] [2022-11-21 16:47:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:46,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:46,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:47:46,253 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:47:46,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-21 16:47:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:46,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:47:46,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:47:46,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:47:46,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:47:46,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129045462] [2022-11-21 16:47:46,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129045462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:46,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:46,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:47:46,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306252590] [2022-11-21 16:47:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:46,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:47:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:47:46,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:47:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:47:46,998 INFO L87 Difference]: Start difference. First operand 3527 states and 4820 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:47:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:47,451 INFO L93 Difference]: Finished difference Result 7110 states and 9701 transitions. [2022-11-21 16:47:47,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:47:47,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2022-11-21 16:47:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:47,465 INFO L225 Difference]: With dead ends: 7110 [2022-11-21 16:47:47,465 INFO L226 Difference]: Without dead ends: 3583 [2022-11-21 16:47:47,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:47:47,474 INFO L413 NwaCegarLoop]: 555 mSDtfsCounter, 16 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:47,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1645 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:47:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2022-11-21 16:47:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3545. [2022-11-21 16:47:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3545 states, 2582 states have (on average 1.2587141750580946) internal successors, (3250), 2583 states have internal predecessors, (3250), 735 states have call successors, (735), 206 states have call predecessors, (735), 227 states have return successors, (851), 771 states have call predecessors, (851), 731 states have call successors, (851) [2022-11-21 16:47:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3545 states to 3545 states and 4836 transitions. [2022-11-21 16:47:47,839 INFO L78 Accepts]: Start accepts. Automaton has 3545 states and 4836 transitions. Word has length 94 [2022-11-21 16:47:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:47,839 INFO L495 AbstractCegarLoop]: Abstraction has 3545 states and 4836 transitions. [2022-11-21 16:47:47,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:47:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3545 states and 4836 transitions. [2022-11-21 16:47:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-21 16:47:47,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:47,842 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:47:47,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:48,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:48,042 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash -153386871, now seen corresponding path program 1 times [2022-11-21 16:47:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:47:48,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341026145] [2022-11-21 16:47:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:48,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:48,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:47:48,045 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:47:48,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-21 16:47:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:48,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 16:47:48,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 16:47:49,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:47:49,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:47:49,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341026145] [2022-11-21 16:47:49,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341026145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:47:49,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:47:49,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:47:49,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120120256] [2022-11-21 16:47:49,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:49,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:47:49,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:47:49,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:47:49,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:47:49,395 INFO L87 Difference]: Start difference. First operand 3545 states and 4836 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:47:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:51,603 INFO L93 Difference]: Finished difference Result 8540 states and 12020 transitions. [2022-11-21 16:47:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:47:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2022-11-21 16:47:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:51,625 INFO L225 Difference]: With dead ends: 8540 [2022-11-21 16:47:51,625 INFO L226 Difference]: Without dead ends: 5431 [2022-11-21 16:47:51,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:47:51,635 INFO L413 NwaCegarLoop]: 880 mSDtfsCounter, 228 mSDsluCounter, 6658 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 7538 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:51,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 7538 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-21 16:47:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5431 states. [2022-11-21 16:47:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5431 to 3545. [2022-11-21 16:47:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3545 states, 2582 states have (on average 1.2556158017041052) internal successors, (3242), 2583 states have internal predecessors, (3242), 735 states have call successors, (735), 206 states have call predecessors, (735), 227 states have return successors, (851), 771 states have call predecessors, (851), 731 states have call successors, (851) [2022-11-21 16:47:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3545 states to 3545 states and 4828 transitions. [2022-11-21 16:47:52,189 INFO L78 Accepts]: Start accepts. Automaton has 3545 states and 4828 transitions. Word has length 96 [2022-11-21 16:47:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:52,190 INFO L495 AbstractCegarLoop]: Abstraction has 3545 states and 4828 transitions. [2022-11-21 16:47:52,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:47:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3545 states and 4828 transitions. [2022-11-21 16:47:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-21 16:47:52,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:52,195 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:47:52,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:52,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:52,408 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:52,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1118734186, now seen corresponding path program 1 times [2022-11-21 16:47:52,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:47:52,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362845911] [2022-11-21 16:47:52,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:52,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:47:52,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:47:52,411 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:47:52,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-21 16:47:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:53,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:47:53,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:47:54,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:47:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 16:47:55,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:47:55,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362845911] [2022-11-21 16:47:55,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362845911] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-21 16:47:55,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:47:55,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-11-21 16:47:55,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006339923] [2022-11-21 16:47:55,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:47:55,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:47:55,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:47:55,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:47:55,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:47:55,011 INFO L87 Difference]: Start difference. First operand 3545 states and 4828 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-21 16:47:57,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:48:00,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:48:02,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:48:04,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:48:07,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:48:09,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:48:14,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:48:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:19,263 INFO L93 Difference]: Finished difference Result 6750 states and 9229 transitions. [2022-11-21 16:48:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:48:19,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 89 [2022-11-21 16:48:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:19,288 INFO L225 Difference]: With dead ends: 6750 [2022-11-21 16:48:19,288 INFO L226 Difference]: Without dead ends: 6747 [2022-11-21 16:48:19,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:48:19,292 INFO L413 NwaCegarLoop]: 883 mSDtfsCounter, 1172 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 220 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:19,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 1981 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1404 Invalid, 6 Unknown, 0 Unchecked, 23.3s Time] [2022-11-21 16:48:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6747 states. [2022-11-21 16:48:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6747 to 6641. [2022-11-21 16:48:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6641 states, 4826 states have (on average 1.2590136759220887) internal successors, (6076), 4817 states have internal predecessors, (6076), 1393 states have call successors, (1393), 380 states have call predecessors, (1393), 421 states have return successors, (1648), 1479 states have call predecessors, (1648), 1389 states have call successors, (1648) [2022-11-21 16:48:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6641 states to 6641 states and 9117 transitions. [2022-11-21 16:48:20,223 INFO L78 Accepts]: Start accepts. Automaton has 6641 states and 9117 transitions. Word has length 89 [2022-11-21 16:48:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:20,224 INFO L495 AbstractCegarLoop]: Abstraction has 6641 states and 9117 transitions. [2022-11-21 16:48:20,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-21 16:48:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 6641 states and 9117 transitions. [2022-11-21 16:48:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-21 16:48:20,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:20,227 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:48:20,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:20,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:20,442 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:20,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:20,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1748979270, now seen corresponding path program 1 times [2022-11-21 16:48:20,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:48:20,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681282681] [2022-11-21 16:48:20,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:20,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:20,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:48:20,445 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:48:20,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-21 16:48:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:21,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 16:48:21,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:48:21,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:48:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:48:22,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:48:22,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681282681] [2022-11-21 16:48:22,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681282681] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:48:22,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:48:22,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2022-11-21 16:48:22,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595518340] [2022-11-21 16:48:22,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:48:22,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 16:48:22,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:48:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 16:48:22,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:48:22,975 INFO L87 Difference]: Start difference. First operand 6641 states and 9117 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 10 states have internal predecessors, (79), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-21 16:48:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:25,757 INFO L93 Difference]: Finished difference Result 16158 states and 22961 transitions. [2022-11-21 16:48:25,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:48:25,757 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 10 states have internal predecessors, (79), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 3 states have call successors, (13) Word has length 94 [2022-11-21 16:48:25,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:25,795 INFO L225 Difference]: With dead ends: 16158 [2022-11-21 16:48:25,796 INFO L226 Difference]: Without dead ends: 9953 [2022-11-21 16:48:25,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:48:25,813 INFO L413 NwaCegarLoop]: 820 mSDtfsCounter, 228 mSDsluCounter, 6988 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 7808 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:25,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 7808 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-21 16:48:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9953 states. [2022-11-21 16:48:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9953 to 6643. [2022-11-21 16:48:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6643 states, 4824 states have (on average 1.2591210613598673) internal successors, (6074), 4825 states have internal predecessors, (6074), 1393 states have call successors, (1393), 380 states have call predecessors, (1393), 425 states have return successors, (1658), 1465 states have call predecessors, (1658), 1389 states have call successors, (1658) [2022-11-21 16:48:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6643 states to 6643 states and 9125 transitions. [2022-11-21 16:48:26,901 INFO L78 Accepts]: Start accepts. Automaton has 6643 states and 9125 transitions. Word has length 94 [2022-11-21 16:48:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:26,902 INFO L495 AbstractCegarLoop]: Abstraction has 6643 states and 9125 transitions. [2022-11-21 16:48:26,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 10 states have internal predecessors, (79), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-21 16:48:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 6643 states and 9125 transitions. [2022-11-21 16:48:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-21 16:48:26,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:26,906 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:48:26,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:27,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:27,128 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash 832679025, now seen corresponding path program 1 times [2022-11-21 16:48:27,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:48:27,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538071469] [2022-11-21 16:48:27,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:27,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:27,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:48:27,130 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:48:27,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-21 16:48:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:27,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 16:48:27,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:48:28,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:48:28,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:48:28,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538071469] [2022-11-21 16:48:28,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538071469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:28,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:28,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:48:28,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360375437] [2022-11-21 16:48:28,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:28,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:48:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:48:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:48:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:48:28,412 INFO L87 Difference]: Start difference. First operand 6643 states and 9125 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:48:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:30,334 INFO L93 Difference]: Finished difference Result 15316 states and 21649 transitions. [2022-11-21 16:48:30,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:48:30,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2022-11-21 16:48:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:30,361 INFO L225 Difference]: With dead ends: 15316 [2022-11-21 16:48:30,361 INFO L226 Difference]: Without dead ends: 9109 [2022-11-21 16:48:30,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:48:30,377 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 213 mSDsluCounter, 6341 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 7176 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:30,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 7176 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:48:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9109 states. [2022-11-21 16:48:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9109 to 6635. [2022-11-21 16:48:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6635 states, 4816 states have (on average 1.2562292358803986) internal successors, (6050), 4821 states have internal predecessors, (6050), 1393 states have call successors, (1393), 380 states have call predecessors, (1393), 425 states have return successors, (1658), 1461 states have call predecessors, (1658), 1389 states have call successors, (1658) [2022-11-21 16:48:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 9101 transitions. [2022-11-21 16:48:31,445 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 9101 transitions. Word has length 97 [2022-11-21 16:48:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:31,445 INFO L495 AbstractCegarLoop]: Abstraction has 6635 states and 9101 transitions. [2022-11-21 16:48:31,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:48:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 9101 transitions. [2022-11-21 16:48:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-21 16:48:31,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:31,448 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:48:31,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:31,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:31,669 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:31,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1118058599, now seen corresponding path program 1 times [2022-11-21 16:48:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:48:31,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086590958] [2022-11-21 16:48:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:31,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:48:31,672 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:48:31,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-21 16:48:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:32,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 16:48:32,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 16:48:32,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:48:32,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:48:32,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086590958] [2022-11-21 16:48:32,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086590958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:32,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:32,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:48:32,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106361411] [2022-11-21 16:48:32,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:32,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:48:32,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:48:32,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:48:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:48:32,846 INFO L87 Difference]: Start difference. First operand 6635 states and 9101 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-21 16:48:35,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:48:37,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-21 16:48:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:37,764 INFO L93 Difference]: Finished difference Result 13330 states and 18284 transitions. [2022-11-21 16:48:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:48:37,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2022-11-21 16:48:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:37,781 INFO L225 Difference]: With dead ends: 13330 [2022-11-21 16:48:37,781 INFO L226 Difference]: Without dead ends: 6701 [2022-11-21 16:48:37,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:48:37,794 INFO L413 NwaCegarLoop]: 560 mSDtfsCounter, 17 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2768 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:37,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2768 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-11-21 16:48:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6701 states. [2022-11-21 16:48:38,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6701 to 6644. [2022-11-21 16:48:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6644 states, 4825 states have (on average 1.2557512953367875) internal successors, (6059), 4827 states have internal predecessors, (6059), 1393 states have call successors, (1393), 380 states have call predecessors, (1393), 425 states have return successors, (1656), 1464 states have call predecessors, (1656), 1389 states have call successors, (1656) [2022-11-21 16:48:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6644 states to 6644 states and 9108 transitions. [2022-11-21 16:48:38,798 INFO L78 Accepts]: Start accepts. Automaton has 6644 states and 9108 transitions. Word has length 108 [2022-11-21 16:48:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:38,798 INFO L495 AbstractCegarLoop]: Abstraction has 6644 states and 9108 transitions. [2022-11-21 16:48:38,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-21 16:48:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 6644 states and 9108 transitions. [2022-11-21 16:48:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-21 16:48:38,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:38,800 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:48:38,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:39,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:39,014 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:39,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:39,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1967666458, now seen corresponding path program 1 times [2022-11-21 16:48:39,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:48:39,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27083689] [2022-11-21 16:48:39,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:39,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:39,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:48:39,016 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:48:39,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-21 16:48:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:48:39,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 16:48:39,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:48:39,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:48:39,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27083689] [2022-11-21 16:48:39,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27083689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:39,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:39,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:48:39,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180102495] [2022-11-21 16:48:39,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:39,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:48:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:48:39,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:48:39,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:48:39,946 INFO L87 Difference]: Start difference. First operand 6644 states and 9108 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-21 16:48:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:40,615 INFO L93 Difference]: Finished difference Result 13315 states and 18256 transitions. [2022-11-21 16:48:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:48:40,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2022-11-21 16:48:40,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:40,636 INFO L225 Difference]: With dead ends: 13315 [2022-11-21 16:48:40,637 INFO L226 Difference]: Without dead ends: 6683 [2022-11-21 16:48:40,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:48:40,648 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 1 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:40,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1085 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:48:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2022-11-21 16:48:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 6670. [2022-11-21 16:48:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6670 states, 4851 states have (on average 1.2543805400948258) internal successors, (6085), 4853 states have internal predecessors, (6085), 1393 states have call successors, (1393), 380 states have call predecessors, (1393), 425 states have return successors, (1656), 1464 states have call predecessors, (1656), 1389 states have call successors, (1656) [2022-11-21 16:48:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 9134 transitions. [2022-11-21 16:48:41,511 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 9134 transitions. Word has length 108 [2022-11-21 16:48:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:41,511 INFO L495 AbstractCegarLoop]: Abstraction has 6670 states and 9134 transitions. [2022-11-21 16:48:41,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-21 16:48:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 9134 transitions. [2022-11-21 16:48:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-21 16:48:41,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:41,514 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:48:41,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:41,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:41,734 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:41,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2053204873, now seen corresponding path program 1 times [2022-11-21 16:48:41,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:48:41,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176985689] [2022-11-21 16:48:41,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:41,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:41,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:48:41,736 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:48:41,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-21 16:48:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:42,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 16:48:42,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:48:43,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:48:43,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:48:43,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176985689] [2022-11-21 16:48:43,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176985689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:43,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:43,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-21 16:48:43,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489545750] [2022-11-21 16:48:43,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:43,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 16:48:43,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:48:43,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 16:48:43,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:48:43,621 INFO L87 Difference]: Start difference. First operand 6670 states and 9134 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:48:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:46,397 INFO L93 Difference]: Finished difference Result 13911 states and 19629 transitions. [2022-11-21 16:48:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:48:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-11-21 16:48:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:46,417 INFO L225 Difference]: With dead ends: 13911 [2022-11-21 16:48:46,418 INFO L226 Difference]: Without dead ends: 9103 [2022-11-21 16:48:46,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:48:46,426 INFO L413 NwaCegarLoop]: 826 mSDtfsCounter, 209 mSDsluCounter, 7908 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 8734 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:46,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 8734 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-21 16:48:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9103 states. [2022-11-21 16:48:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9103 to 6614. [2022-11-21 16:48:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6614 states, 4821 states have (on average 1.2543040862891517) internal successors, (6047), 4833 states have internal predecessors, (6047), 1369 states have call successors, (1369), 376 states have call predecessors, (1369), 423 states have return successors, (1620), 1432 states have call predecessors, (1620), 1365 states have call successors, (1620) [2022-11-21 16:48:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6614 states to 6614 states and 9036 transitions. [2022-11-21 16:48:47,217 INFO L78 Accepts]: Start accepts. Automaton has 6614 states and 9036 transitions. Word has length 104 [2022-11-21 16:48:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:47,217 INFO L495 AbstractCegarLoop]: Abstraction has 6614 states and 9036 transitions. [2022-11-21 16:48:47,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:48:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 6614 states and 9036 transitions. [2022-11-21 16:48:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-21 16:48:47,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:47,220 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:47,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:47,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:47,421 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:47,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1396982830, now seen corresponding path program 1 times [2022-11-21 16:48:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:48:47,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673468448] [2022-11-21 16:48:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:47,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:48:47,424 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:48:47,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-21 16:48:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:48,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:48:48,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 16:48:48,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:48:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-21 16:48:48,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:48:48,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673468448] [2022-11-21 16:48:48,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673468448] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:48:48,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:48:48,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-21 16:48:48,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912131324] [2022-11-21 16:48:48,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:48:48,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:48:48,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:48:48,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:48:48,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:48:48,717 INFO L87 Difference]: Start difference. First operand 6614 states and 9036 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-21 16:48:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:49,635 INFO L93 Difference]: Finished difference Result 13333 states and 18216 transitions. [2022-11-21 16:48:49,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:48:49,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2022-11-21 16:48:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:49,653 INFO L225 Difference]: With dead ends: 13333 [2022-11-21 16:48:49,653 INFO L226 Difference]: Without dead ends: 6731 [2022-11-21 16:48:49,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:48:49,662 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 4 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:49,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2709 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:48:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6731 states. [2022-11-21 16:48:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6731 to 6731. [2022-11-21 16:48:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6731 states, 4938 states have (on average 1.248278655326043) internal successors, (6164), 4950 states have internal predecessors, (6164), 1369 states have call successors, (1369), 376 states have call predecessors, (1369), 423 states have return successors, (1620), 1432 states have call predecessors, (1620), 1365 states have call successors, (1620) [2022-11-21 16:48:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 9153 transitions. [2022-11-21 16:48:50,404 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 9153 transitions. Word has length 111 [2022-11-21 16:48:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:50,404 INFO L495 AbstractCegarLoop]: Abstraction has 6731 states and 9153 transitions. [2022-11-21 16:48:50,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-21 16:48:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 9153 transitions. [2022-11-21 16:48:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-21 16:48:50,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:50,408 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-11-21 16:48:50,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:50,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:50,631 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:50,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:50,632 INFO L85 PathProgramCache]: Analyzing trace with hash -756764579, now seen corresponding path program 1 times [2022-11-21 16:48:50,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:48:50,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512136640] [2022-11-21 16:48:50,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:50,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:50,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:48:50,634 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:48:50,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-21 16:48:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 16:48:51,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 16:48:52,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:48:52,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:48:52,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512136640] [2022-11-21 16:48:52,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512136640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:52,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:52,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:48:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908962838] [2022-11-21 16:48:52,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:52,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:48:52,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:48:52,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:48:52,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:48:52,053 INFO L87 Difference]: Start difference. First operand 6731 states and 9153 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 16:48:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:54,881 INFO L93 Difference]: Finished difference Result 14626 states and 20462 transitions. [2022-11-21 16:48:54,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:48:54,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2022-11-21 16:48:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:54,904 INFO L225 Difference]: With dead ends: 14626 [2022-11-21 16:48:54,904 INFO L226 Difference]: Without dead ends: 9793 [2022-11-21 16:48:54,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:48:54,913 INFO L413 NwaCegarLoop]: 828 mSDtfsCounter, 224 mSDsluCounter, 6347 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 7175 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:54,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 7175 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-21 16:48:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9793 states. [2022-11-21 16:48:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9793 to 6747. [2022-11-21 16:48:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6747 states, 4954 states have (on average 1.2474767864352039) internal successors, (6180), 4958 states have internal predecessors, (6180), 1369 states have call successors, (1369), 376 states have call predecessors, (1369), 423 states have return successors, (1620), 1440 states have call predecessors, (1620), 1365 states have call successors, (1620) [2022-11-21 16:48:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6747 states to 6747 states and 9169 transitions. [2022-11-21 16:48:55,752 INFO L78 Accepts]: Start accepts. Automaton has 6747 states and 9169 transitions. Word has length 122 [2022-11-21 16:48:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:55,753 INFO L495 AbstractCegarLoop]: Abstraction has 6747 states and 9169 transitions. [2022-11-21 16:48:55,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 16:48:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 6747 states and 9169 transitions. [2022-11-21 16:48:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-21 16:48:55,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:55,756 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-11-21 16:48:55,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:55,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:55,958 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:55,959 INFO L85 PathProgramCache]: Analyzing trace with hash -645931029, now seen corresponding path program 1 times [2022-11-21 16:48:55,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:48:55,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082146604] [2022-11-21 16:48:55,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:55,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:48:55,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:48:55,960 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:48:55,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-21 16:48:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:56,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 16:48:56,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 16:48:57,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:48:57,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:48:57,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082146604] [2022-11-21 16:48:57,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082146604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:57,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:57,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:48:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290701844] [2022-11-21 16:48:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:57,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:48:57,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:48:57,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:48:57,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:48:57,182 INFO L87 Difference]: Start difference. First operand 6747 states and 9169 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 16:48:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:59,564 INFO L93 Difference]: Finished difference Result 16088 states and 22390 transitions. [2022-11-21 16:48:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:48:59,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2022-11-21 16:48:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:59,587 INFO L225 Difference]: With dead ends: 16088 [2022-11-21 16:48:59,587 INFO L226 Difference]: Without dead ends: 9788 [2022-11-21 16:48:59,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:48:59,598 INFO L413 NwaCegarLoop]: 819 mSDtfsCounter, 177 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 3036 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:59,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 3036 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-21 16:48:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9788 states. [2022-11-21 16:49:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9788 to 6550. [2022-11-21 16:49:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6550 states, 4837 states have (on average 1.2460202604920405) internal successors, (6027), 4841 states have internal predecessors, (6027), 1305 states have call successors, (1305), 360 states have call predecessors, (1305), 407 states have return successors, (1544), 1376 states have call predecessors, (1544), 1301 states have call successors, (1544) [2022-11-21 16:49:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6550 states to 6550 states and 8876 transitions. [2022-11-21 16:49:00,415 INFO L78 Accepts]: Start accepts. Automaton has 6550 states and 8876 transitions. Word has length 124 [2022-11-21 16:49:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:00,415 INFO L495 AbstractCegarLoop]: Abstraction has 6550 states and 8876 transitions. [2022-11-21 16:49:00,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 16:49:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 6550 states and 8876 transitions. [2022-11-21 16:49:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-21 16:49:00,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:00,417 INFO L195 NwaCegarLoop]: trace histogram [4, 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-21 16:49:00,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-21 16:49:00,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:49:00,618 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:49:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash -61836419, now seen corresponding path program 1 times [2022-11-21 16:49:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:49:00,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878694846] [2022-11-21 16:49:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:00,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:49:00,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:49:00,620 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:49:00,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-21 16:49:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:01,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 16:49:01,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:49:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 16:49:02,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:49:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 16:49:03,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:49:03,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878694846] [2022-11-21 16:49:03,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878694846] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:49:03,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:49:03,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2022-11-21 16:49:03,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172385797] [2022-11-21 16:49:03,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:49:03,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 16:49:03,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:49:03,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 16:49:03,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:49:03,387 INFO L87 Difference]: Start difference. First operand 6550 states and 8876 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 10 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-21 16:49:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:07,746 INFO L93 Difference]: Finished difference Result 16182 states and 22571 transitions. [2022-11-21 16:49:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:49:07,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 10 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18) Word has length 122 [2022-11-21 16:49:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:07,768 INFO L225 Difference]: With dead ends: 16182 [2022-11-21 16:49:07,769 INFO L226 Difference]: Without dead ends: 10079 [2022-11-21 16:49:07,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:49:07,781 INFO L413 NwaCegarLoop]: 780 mSDtfsCounter, 232 mSDsluCounter, 8219 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 8999 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:07,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 8999 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-21 16:49:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10079 states. [2022-11-21 16:49:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10079 to 6538. [2022-11-21 16:49:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6538 states, 4825 states have (on average 1.2466321243523315) internal successors, (6015), 4841 states have internal predecessors, (6015), 1305 states have call successors, (1305), 360 states have call predecessors, (1305), 407 states have return successors, (1520), 1364 states have call predecessors, (1520), 1301 states have call successors, (1520) [2022-11-21 16:49:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6538 states to 6538 states and 8840 transitions. [2022-11-21 16:49:08,626 INFO L78 Accepts]: Start accepts. Automaton has 6538 states and 8840 transitions. Word has length 122 [2022-11-21 16:49:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:08,627 INFO L495 AbstractCegarLoop]: Abstraction has 6538 states and 8840 transitions. [2022-11-21 16:49:08,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 10 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-21 16:49:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 8840 transitions. [2022-11-21 16:49:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-21 16:49:08,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:08,629 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:49:08,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-11-21 16:49:08,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:49:08,842 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:49:08,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1117139730, now seen corresponding path program 1 times [2022-11-21 16:49:08,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:49:08,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540807703] [2022-11-21 16:49:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:08,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:49:08,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:49:08,844 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:49:08,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-21 16:49:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:49:16,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:49:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:49:24,441 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 16:49:24,441 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:49:24,442 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 16:49:24,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-21 16:49:24,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:49:24,677 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:24,680 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:49:24,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:49:24 BoogieIcfgContainer [2022-11-21 16:49:24,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:49:24,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:49:24,818 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:49:24,818 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:49:24,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:46:41" (3/4) ... [2022-11-21 16:49:24,820 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 16:49:24,932 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:49:24,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:49:24,933 INFO L158 Benchmark]: Toolchain (without parser) took 183389.12ms. Allocated memory was 81.8MB in the beginning and 2.2GB in the end (delta: 2.2GB). Free memory was 51.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 954.0MB. Max. memory is 16.1GB. [2022-11-21 16:49:24,933 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 58.7MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:49:24,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3195.52ms. Allocated memory was 81.8MB in the beginning and 132.1MB in the end (delta: 50.3MB). Free memory was 51.8MB in the beginning and 64.8MB in the end (delta: -13.0MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2022-11-21 16:49:24,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 238.04ms. Allocated memory is still 132.1MB. Free memory was 64.8MB in the beginning and 55.7MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 16:49:24,934 INFO L158 Benchmark]: Boogie Preprocessor took 281.51ms. Allocated memory was 132.1MB in the beginning and 165.7MB in the end (delta: 33.6MB). Free memory was 55.7MB in the beginning and 106.8MB in the end (delta: -51.0MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-11-21 16:49:24,934 INFO L158 Benchmark]: RCFGBuilder took 15821.60ms. Allocated memory is still 165.7MB. Free memory was 106.8MB in the beginning and 74.0MB in the end (delta: 32.7MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2022-11-21 16:49:24,935 INFO L158 Benchmark]: TraceAbstraction took 163723.70ms. Allocated memory was 165.7MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 74.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 867.3MB. Max. memory is 16.1GB. [2022-11-21 16:49:24,935 INFO L158 Benchmark]: Witness Printer took 114.69ms. Allocated memory is still 2.2GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 16:49:24,936 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 58.7MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3195.52ms. Allocated memory was 81.8MB in the beginning and 132.1MB in the end (delta: 50.3MB). Free memory was 51.8MB in the beginning and 64.8MB in the end (delta: -13.0MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 238.04ms. Allocated memory is still 132.1MB. Free memory was 64.8MB in the beginning and 55.7MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 281.51ms. Allocated memory was 132.1MB in the beginning and 165.7MB in the end (delta: 33.6MB). Free memory was 55.7MB in the beginning and 106.8MB in the end (delta: -51.0MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * RCFGBuilder took 15821.60ms. Allocated memory is still 165.7MB. Free memory was 106.8MB in the beginning and 74.0MB in the end (delta: 32.7MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. * TraceAbstraction took 163723.70ms. Allocated memory was 165.7MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 74.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 867.3MB. Max. memory is 16.1GB. * Witness Printer took 114.69ms. Allocated memory is still 2.2GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 6754]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L5149] static struct lock_class_key __key___7 ; [L5150] static struct lock_class_key __key___8 ; [L5290-L5303] static char const __mod_author31[46] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'S', (char const )'e', (char const )'b', (char const )'a', (char const )'s', (char const )'t', (char const )'i', (char const )'a', (char const )'n', (char const )' ', (char const )'H', (char const )'a', (char const )'a', (char const )'s', (char const )' ', (char const )'<', (char const )'h', (char const )'a', (char const )'a', (char const )'s', (char const )'@', (char const )'e', (char const )'m', (char const )'s', (char const )'-', (char const )'w', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )'.', (char const )'c', (char const )'o', (char const )'m', (char const )'>', (char const )'\000'}; [L5304-L5323] static char const __mod_description32[70] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'N', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )' ', (char const )'f', (char const )'o', (char const )'r', (char const )' ', (char const )'E', (char const )'M', (char const )'S', (char const )' ', (char const )'D', (char const )'r', (char const )'.', (char const )' ', (char const )'T', (char const )'h', (char const )'o', (char const )'m', (char const )'a', (char const )'s', (char const )' ', (char const )'W', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )' ', (char const )'C', (char const )'A', (char const )'N', (char const )'/', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'i', (char const )'n', (char const )'t', (char const )'e', (char const )'r', (char const )'f', (char const )'a', (char const )'c', (char const )'e', (char const )'s', (char const )'\000'}; [L5324-L5329] static char const __mod_license33[15] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )' ', (char const )'v', (char const )'2', (char const )'\000'}; [L5330-L5332] static struct usb_device_id ems_usb_table[1] = { {(__u16 )3, (__u16 )4822, (__u16 )1092, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6247-L6287] static struct net_device_ops const ems_usb_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & ems_usb_open, & ems_usb_close, & ems_usb_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , void *addr ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, (int (*)(struct net_device *dev , int new_mtu ))0, (int (*)(struct net_device *dev , struct neigh_parms * ))0, (void (*)(struct net_device *dev ))0, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6288-L6292] static struct can_bittiming_const ems_usb_bittiming_const = {{(char )'e', (char )'m', (char )'s', (char )'_', (char )'u', (char )'s', (char )'b', (char )'\000', (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}, (__u32 )1, (__u32 )16, (__u32 )1, (__u32 )8, (__u32 )4, (__u32 )1, (__u32 )64, (__u32 )1}; [L6543-L6561] static struct usb_driver ems_usb_driver = {"ems_usb", & ems_usb_probe, & ems_usb_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(ems_usb_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6614] int LDV_IN_INTERRUPT ; [L6615] static int res_ems_usb_open_10 ; [L6616] static int res_ems_usb_close_12 ; [L6617] static int res_ems_usb_probe_16 ; [L6767] int ldv_urb_state = 0; [L6768] int ldv_coherent_state = 0; VAL [__key___7={36:0}, __key___8={37:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6619] struct net_device *var_group1 ; [L6620] struct sk_buff *var_group2 ; [L6621] struct usb_interface *var_group3 ; [L6622] struct usb_device_id const *var_ems_usb_probe_16_p1 ; [L6623] int tmp___7 ; [L6624] int ldv_s_ems_usb_netdev_ops_net_device_ops ; [L6625] int ldv_s_ems_usb_driver_usb_driver ; [L6626] int tmp___8 ; [L6627] int tmp___9 ; [L6630] LDV_IN_INTERRUPT = 1 [L6631] FCALL ldv_initialize() [L6632] CALL, EXPR ems_usb_init() VAL [__key___7={36:0}, __key___8={37:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6565] int err ; [L6569] CALL, EXPR usb_register(& ems_usb_driver) [L5140] int tmp___7 ; [L5143] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L7025] return __VERIFIER_nondet_int(); [L5143] RET, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L5143] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb") [L5145] return (tmp___7); VAL [\result=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, driver={41:0}, driver={41:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6569] RET, EXPR usb_register(& ems_usb_driver) [L6569] err = usb_register(& ems_usb_driver) [L6571] COND FALSE !(\read(err)) [L6578] return (0); VAL [\result=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, err=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] RET, EXPR ems_usb_init() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_init()=0, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] tmp___7 = ems_usb_init() [L6634] COND FALSE !(\read(tmp___7)) [L6638] ldv_s_ems_usb_netdev_ops_net_device_ops = 0 [L6639] ldv_s_ems_usb_driver_usb_driver = 0 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6641] COND TRUE 1 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND TRUE \read(tmp___9) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___9=-2147483648] [L6655] tmp___8 = __VERIFIER_nondet_int() [L6657] COND FALSE !(tmp___8 == 0) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=-2147483648] [L6660] COND FALSE !(tmp___8 == 1) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=-2147483648] [L6663] COND TRUE tmp___8 == 2 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=-2147483648] [L6704] CALL ems_usb_start_xmit(var_group2, var_group1) [L6048] struct ems_usb *dev ; [L6049] void *tmp___7 ; [L6050] struct ems_tx_urb_context *context ; [L6051] struct net_device_stats *stats ; [L6052] struct can_frame *cf ; [L6053] struct ems_cpc_msg *msg ; [L6054] struct urb *urb ; [L6055] u8 *buf ; [L6056] int i ; [L6057] int err ; [L6058] size_t size ; [L6059] int tmp___8 ; [L6060] void *tmp___9 ; [L6061] unsigned int tmp___10 ; [L6062] int tmp___11 ; [L6063] long tmp___12 ; VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}] [L6066] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L4976] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [\result={0:-520}, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6066] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={0:-2952}, netdev={0:-2952}, netdev_priv((struct net_device const *)netdev)={0:-520}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}] [L6066] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6067] dev = (struct ems_usb *)tmp___7 [L6068] context = (struct ems_tx_urb_context *)((void *)0) [L6069] stats = & netdev->stats [L6070] EXPR skb->data [L6070] cf = (struct can_frame *)skb->data [L6071] size = 15UL + sizeof(struct cpc_can_msg ) [L6072] CALL, EXPR can_dropped_invalid_skb(netdev, skb) [L5252] struct can_frame const *cf ; [L5253] int tmp___7 ; [L5254] long tmp___8 ; [L5256] EXPR skb->data [L5256] cf = (struct can_frame const *)((struct can_frame *)skb->data) [L5257] EXPR skb->len VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}, skb->len=13] [L5257] COND FALSE !((unsigned long )skb->len != sizeof(*cf)) [L5260] EXPR cf->can_dlc VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, cf->can_dlc=0, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}] [L5260] COND FALSE !((int const )cf->can_dlc > 8) [L5263] tmp___7 = 0 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}, tmp___7=0] [L5266] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}, tmp___7=0, tmp___8=0] [L5268] COND FALSE !(\read(tmp___8)) [L5276] return (0); VAL [\result=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}, tmp___7=0, tmp___8=0] [L6072] RET, EXPR can_dropped_invalid_skb(netdev, skb) [L6072] tmp___8 = can_dropped_invalid_skb(netdev, skb) [L6074] COND FALSE !(\read(tmp___8)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0] [L6079] CALL, EXPR usb_alloc_urb(0, 32U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6830] void *arbitrary_memory ; [L6831] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6834] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6837] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, \old(size)=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={69:0}, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] return ldv_malloc(0UL); [L6837] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={69:0}, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6837] tmp___7 = ldv_undefined_pointer() [L6838] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, arbitrary_memory={69:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7={69:0}] [L6840] COND FALSE !(! arbitrary_memory) [L6844] ldv_urb_state = ldv_urb_state + 1 [L6845] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, \result={69:0}, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, arbitrary_memory={69:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7={69:0}] [L6079] RET, EXPR usb_alloc_urb(0, 32U) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, usb_alloc_urb(0, 32U)={69:0}] [L6079] urb = usb_alloc_urb(0, 32U) [L6081] COND FALSE !(! urb) [L6089] EXPR dev->udev VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, context={0:0}, dev={0:-520}, dev->udev={0:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, urb={69:0}] [L6089] CALL, EXPR usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, dev={0:0}, dma={69:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6773] void *arbitrary_memory ; [L6774] void *tmp___7 ; VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, dev={0:0}, dev={0:0}, dma={69:104}, dma={69:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6777] COND TRUE 1 VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, dev={0:0}, dev={0:0}, dma={69:104}, dma={69:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6780] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_coherent_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_coherent_state)=0, \old(size)=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_coherent_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={16412:0}, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] return ldv_malloc(0UL); [L6780] RET, EXPR ldv_undefined_pointer() VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, dev={0:0}, dev={0:0}, dma={69:104}, dma={69:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={16412:0}, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6780] tmp___7 = ldv_undefined_pointer() [L6781] arbitrary_memory = tmp___7 VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, arbitrary_memory={16412:0}, dev={0:0}, dev={0:0}, dma={69:104}, dma={69:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, tmp___7={16412:0}] [L6783] COND FALSE !(! arbitrary_memory) [L6787] ldv_coherent_state = ldv_coherent_state + 1 [L6788] return (arbitrary_memory); VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, \result={16412:0}, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, arbitrary_memory={16412:0}, dev={0:0}, dev={0:0}, dma={69:104}, dma={69:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, tmp___7={16412:0}] [L6089] RET, EXPR usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, context={0:0}, dev={0:-520}, dev->udev={0:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, urb={69:0}, usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma)={16412:0}] [L6089] tmp___9 = usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) [L6090] buf = (u8 *)tmp___9 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6092] COND FALSE !(! buf) [L6100] msg = (struct ems_cpc_msg *)(buf + 4) [L6101] EXPR cf->can_id [L6101] msg->msg.can_msg.id = cf->can_id & 536870911U [L6102] EXPR cf->can_dlc [L6102] msg->msg.can_msg.length = cf->can_dlc [L6103] EXPR cf->can_id VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, cf->can_id=-1073741824, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6103] COND TRUE cf->can_id & 1073741824U [L6104] EXPR cf->can_id VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, cf->can_id=-1073741824, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6104] COND TRUE cf->can_id & 2147483648U [L6105] msg->type = (u8 )16 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6109] msg->length = (u8 )5 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6132] EXPR msg->msg.can_msg.id [L6132] msg->msg.can_msg.id = msg->msg.can_msg.id [L6133] i = 0 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6135] COND TRUE 1 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6137] COND TRUE i < 10 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6141] EXPR dev->tx_contexts[i].echo_index VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, dev->tx_contexts[i].echo_index=10, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6141] COND TRUE dev->tx_contexts[i].echo_index == 10U [L6142] context = & dev->tx_contexts[i] VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6151] COND TRUE ! context VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6153] FCALL usb_unanchor_urb(urb) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6154] EXPR dev->udev [L6154] EXPR urb->transfer_dma VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, dev->udev={0:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}, urb->transfer_dma=36099165763141632] [L6154] CALL usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma) VAL [\old(dma)=36099165763141632, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={16412:0}, dev={0:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6802] COND TRUE 1 VAL [\old(dma)=36099165763141632, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={16412:0}, addr={16412:0}, dev={0:0}, dev={0:0}, dma=36099165763141632, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6804] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0))) VAL [\old(dma)=36099165763141632, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={16412:0}, addr={16412:0}, dev={0:0}, dev={0:0}, dma=36099165763141632, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6810] COND TRUE \read(*addr) VAL [\old(dma)=36099165763141632, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={16412:0}, addr={16412:0}, dev={0:0}, dev={0:0}, dma=36099165763141632, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6811] COND TRUE ldv_coherent_state >= 1 VAL [\old(dma)=36099165763141632, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={16412:0}, addr={16412:0}, dev={0:0}, dev={0:0}, dma=36099165763141632, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6817] ldv_coherent_state = ldv_coherent_state - 1 VAL [\old(dma)=36099165763141632, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={16412:0}, addr={16412:0}, dev={0:0}, dev={0:0}, dma=36099165763141632, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6154] RET usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, dev->udev={0:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}, urb->transfer_dma=36099165763141632] [L6155] netdev->dev.parent [L6157] return ((netdev_tx_t )16); VAL [\result=16, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={16412:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={16412:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={16412:0}, urb={69:0}] [L6704] RET ems_usb_start_xmit(var_group2, var_group1) [L6641] COND TRUE 1 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=-2147483648, var_group1={0:-2952}, var_group2={0:0}] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND FALSE !(\read(tmp___9)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-2952}, var_group2={0:0}] [L6648] COND FALSE !(! (ldv_s_ems_usb_netdev_ops_net_device_ops == 0)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-2952}, var_group2={0:0}] [L6650] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-2952}, var_group2={0:0}] [L6742] CALL ems_usb_exit() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6587] FCALL usb_deregister(& ems_usb_driver) [L6742] RET ems_usb_exit() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-2952}, var_group2={0:0}] [L6746] CALL ldv_check_final_state() [L6889] COND FALSE !(ldv_urb_state == 0) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6892] CALL ldv_blast_assert() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6754] reach_error() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 36 procedures, 432 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 163.5s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 88.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 7914 SdHoareTripleChecker+Valid, 68.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6840 mSDsluCounter, 101143 SdHoareTripleChecker+Invalid, 66.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81028 mSDsCounter, 838 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5087 IncrementalHoareTripleChecker+Invalid, 5935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 838 mSolverCounterUnsat, 20115 mSDtfsCounter, 5087 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2923 GetRequests, 2775 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6747occurred in iteration=26, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 29498 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 20.3s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 2523 NumberOfCodeBlocks, 2523 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2895 ConstructedInterpolants, 0 QuantifiedInterpolants, 4246 SizeOfPredicates, 46 NumberOfNonLiveVariables, 23333 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 33 InterpolantComputations, 24 PerfectInterpolantSequences, 300/334 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-21 16:49:25,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a49b3ed1-847c-497c-8564-e149aef63d8f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE