./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 c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 01:33:02,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 01:33:02,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 01:33:02,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 01:33:02,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 01:33:02,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 01:33:02,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 01:33:02,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 01:33:02,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 01:33:02,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 01:33:02,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 01:33:02,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 01:33:02,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 01:33:02,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 01:33:02,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 01:33:02,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 01:33:02,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 01:33:02,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 01:33:02,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 01:33:02,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 01:33:02,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 01:33:02,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 01:33:02,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 01:33:02,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 01:33:02,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 01:33:02,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 01:33:02,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 01:33:02,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 01:33:02,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 01:33:02,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 01:33:02,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 01:33:02,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 01:33:02,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 01:33:02,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 01:33:02,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 01:33:02,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 01:33:02,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 01:33:02,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 01:33:02,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 01:33:02,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 01:33:02,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 01:33:02,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 01:33:02,897 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 01:33:02,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 01:33:02,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 01:33:02,898 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 01:33:02,899 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 01:33:02,899 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 01:33:02,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 01:33:02,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 01:33:02,900 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 01:33:02,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 01:33:02,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 01:33:02,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 01:33:02,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 01:33:02,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 01:33:02,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 01:33:02,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 01:33:02,903 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 01:33:02,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 01:33:02,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 01:33:02,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 01:33:02,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 01:33:02,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:33:02,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 01:33:02,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 01:33:02,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 01:33:02,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 01:33:02,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 01:33:02,906 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 01:33:02,906 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 01:33:02,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 01:33:02,907 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 01:33:02,911 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2021-12-18 01:33:03,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 01:33:03,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 01:33:03,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 01:33:03,163 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 01:33:03,163 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 01:33:03,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-12-18 01:33:03,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e684c0d/5c7438a180e24a6897ce3a313f01a580/FLAGcb76dcf20 [2021-12-18 01:33:03,836 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 01:33:03,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-12-18 01:33:03,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e684c0d/5c7438a180e24a6897ce3a313f01a580/FLAGcb76dcf20 [2021-12-18 01:33:04,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e684c0d/5c7438a180e24a6897ce3a313f01a580 [2021-12-18 01:33:04,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 01:33:04,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 01:33:04,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 01:33:04,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 01:33:04,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 01:33:04,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:33:04" (1/1) ... [2021-12-18 01:33:04,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8742f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04, skipping insertion in model container [2021-12-18 01:33:04,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:33:04" (1/1) ... [2021-12-18 01:33:04,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 01:33:04,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 01:33:05,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-12-18 01:33:05,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:33:05,403 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 01:33:05,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-12-18 01:33:05,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:33:05,749 INFO L208 MainTranslator]: Completed translation [2021-12-18 01:33:05,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05 WrapperNode [2021-12-18 01:33:05,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 01:33:05,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 01:33:05,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 01:33:05,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 01:33:05,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05" (1/1) ... [2021-12-18 01:33:05,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05" (1/1) ... [2021-12-18 01:33:05,842 INFO L137 Inliner]: procedures = 133, calls = 733, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1375 [2021-12-18 01:33:05,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 01:33:05,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 01:33:05,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 01:33:05,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 01:33:05,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05" (1/1) ... [2021-12-18 01:33:05,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05" (1/1) ... [2021-12-18 01:33:05,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05" (1/1) ... [2021-12-18 01:33:05,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05" (1/1) ... [2021-12-18 01:33:05,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05" (1/1) ... [2021-12-18 01:33:05,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05" (1/1) ... [2021-12-18 01:33:05,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05" (1/1) ... [2021-12-18 01:33:05,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 01:33:06,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 01:33:06,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 01:33:06,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 01:33:06,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05" (1/1) ... [2021-12-18 01:33:06,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:33:06,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:06,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 01:33:06,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 01:33:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2021-12-18 01:33:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2021-12-18 01:33:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2021-12-18 01:33:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2021-12-18 01:33:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-18 01:33:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2021-12-18 01:33:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2021-12-18 01:33:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 01:33:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 01:33:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 01:33:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2021-12-18 01:33:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2021-12-18 01:33:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2021-12-18 01:33:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2021-12-18 01:33:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-12-18 01:33:06,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-12-18 01:33:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 01:33:06,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 01:33:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2021-12-18 01:33:06,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2021-12-18 01:33:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2021-12-18 01:33:06,080 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2021-12-18 01:33:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-18 01:33:06,080 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-18 01:33:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2021-12-18 01:33:06,080 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2021-12-18 01:33:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 01:33:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2021-12-18 01:33:06,081 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2021-12-18 01:33:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2021-12-18 01:33:06,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2021-12-18 01:33:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2021-12-18 01:33:06,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2021-12-18 01:33:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-12-18 01:33:06,081 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-12-18 01:33:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2021-12-18 01:33:06,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2021-12-18 01:33:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 01:33:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2021-12-18 01:33:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2021-12-18 01:33:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 01:33:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2021-12-18 01:33:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2021-12-18 01:33:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 01:33:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 01:33:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2021-12-18 01:33:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2021-12-18 01:33:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-12-18 01:33:06,084 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-12-18 01:33:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2021-12-18 01:33:06,084 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2021-12-18 01:33:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 01:33:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2021-12-18 01:33:06,085 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2021-12-18 01:33:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2021-12-18 01:33:06,085 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2021-12-18 01:33:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2021-12-18 01:33:06,086 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2021-12-18 01:33:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2021-12-18 01:33:06,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2021-12-18 01:33:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 01:33:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 01:33:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-18 01:33:06,088 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-18 01:33:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2021-12-18 01:33:06,088 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2021-12-18 01:33:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-18 01:33:06,088 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-18 01:33:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2021-12-18 01:33:06,089 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2021-12-18 01:33:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-18 01:33:06,089 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-18 01:33:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-12-18 01:33:06,090 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-12-18 01:33:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2021-12-18 01:33:06,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2021-12-18 01:33:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2021-12-18 01:33:06,090 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2021-12-18 01:33:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 01:33:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2021-12-18 01:33:06,091 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2021-12-18 01:33:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2021-12-18 01:33:06,091 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2021-12-18 01:33:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-18 01:33:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 01:33:06,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 01:33:06,454 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 01:33:06,456 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 01:33:06,719 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2021-12-18 01:33:06,832 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:33:08,337 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2021-12-18 01:33:08,337 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2021-12-18 01:33:08,370 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 01:33:08,397 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 01:33:08,398 INFO L301 CfgBuilder]: Removed 13 assume(true) statements. [2021-12-18 01:33:08,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:33:08 BoogieIcfgContainer [2021-12-18 01:33:08,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 01:33:08,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 01:33:08,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 01:33:08,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 01:33:08,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:33:04" (1/3) ... [2021-12-18 01:33:08,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c98549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:33:08, skipping insertion in model container [2021-12-18 01:33:08,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:05" (2/3) ... [2021-12-18 01:33:08,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c98549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:33:08, skipping insertion in model container [2021-12-18 01:33:08,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:33:08" (3/3) ... [2021-12-18 01:33:08,411 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-12-18 01:33:08,417 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 01:33:08,417 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 01:33:08,474 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 01:33:08,481 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 01:33:08,482 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 01:33:08,516 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) [2021-12-18 01:33:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 01:33:08,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:08,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:33:08,521 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:08,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1517292025, now seen corresponding path program 1 times [2021-12-18 01:33:08,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:08,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177184905] [2021-12-18 01:33:08,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:08,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:08,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:33:08,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:08,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177184905] [2021-12-18 01:33:08,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177184905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:08,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:08,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 01:33:08,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600793454] [2021-12-18 01:33:08,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:08,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:33:08,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:08,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:33:08,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:33:08,983 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) [2021-12-18 01:33:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:09,177 INFO L93 Difference]: Finished difference Result 1253 states and 1768 transitions. [2021-12-18 01:33:09,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:33:09,179 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 [2021-12-18 01:33:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:09,198 INFO L225 Difference]: With dead ends: 1253 [2021-12-18 01:33:09,201 INFO L226 Difference]: Without dead ends: 824 [2021-12-18 01:33:09,208 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:09,215 INFO L933 BasicCegarLoop]: 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 [2021-12-18 01:33:09,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 1229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:33:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-12-18 01:33:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2021-12-18 01:33:09,317 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) [2021-12-18 01:33:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1076 transitions. [2021-12-18 01:33:09,326 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1076 transitions. Word has length 16 [2021-12-18 01:33:09,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:09,326 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1076 transitions. [2021-12-18 01:33:09,326 INFO L471 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) [2021-12-18 01:33:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1076 transitions. [2021-12-18 01:33:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 01:33:09,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:09,328 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:33:09,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 01:33:09,328 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:09,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash 208359179, now seen corresponding path program 1 times [2021-12-18 01:33:09,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:09,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281668697] [2021-12-18 01:33:09,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:09,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:09,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:33:09,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:09,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281668697] [2021-12-18 01:33:09,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281668697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:09,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:09,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 01:33:09,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019859162] [2021-12-18 01:33:09,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:09,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:33:09,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:09,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:33:09,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:33:09,444 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) [2021-12-18 01:33:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:09,531 INFO L93 Difference]: Finished difference Result 2433 states and 3207 transitions. [2021-12-18 01:33:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:33:09,532 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 [2021-12-18 01:33:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:09,544 INFO L225 Difference]: With dead ends: 2433 [2021-12-18 01:33:09,545 INFO L226 Difference]: Without dead ends: 1617 [2021-12-18 01:33:09,551 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:09,572 INFO L933 BasicCegarLoop]: 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 [2021-12-18 01:33:09,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 1161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:33:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2021-12-18 01:33:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1610. [2021-12-18 01:33:09,674 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) [2021-12-18 01:33:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2021-12-18 01:33:09,684 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 17 [2021-12-18 01:33:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:09,685 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2021-12-18 01:33:09,685 INFO L471 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) [2021-12-18 01:33:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2021-12-18 01:33:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-18 01:33:09,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:09,694 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:09,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 01:33:09,694 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:09,702 INFO L85 PathProgramCache]: Analyzing trace with hash 26582145, now seen corresponding path program 1 times [2021-12-18 01:33:09,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:09,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012136700] [2021-12-18 01:33:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:09,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:09,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:09,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 01:33:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:09,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-18 01:33:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:09,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:33:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:09,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:33:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:09,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:09,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:33:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:09,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 01:33:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:33:09,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:09,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012136700] [2021-12-18 01:33:09,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012136700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:09,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:09,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 01:33:09,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49391454] [2021-12-18 01:33:09,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:09,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:33:09,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:33:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:33:09,933 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) [2021-12-18 01:33:12,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:12,098 INFO L93 Difference]: Finished difference Result 3324 states and 4411 transitions. [2021-12-18 01:33:12,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:33:12,099 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 [2021-12-18 01:33:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:12,109 INFO L225 Difference]: With dead ends: 3324 [2021-12-18 01:33:12,110 INFO L226 Difference]: Without dead ends: 1722 [2021-12-18 01:33:12,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:33:12,130 INFO L933 BasicCegarLoop]: 528 mSDtfsCounter, 235 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:12,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 2218 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-18 01:33:12,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2021-12-18 01:33:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1610. [2021-12-18 01:33:12,221 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) [2021-12-18 01:33:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2116 transitions. [2021-12-18 01:33:12,231 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2116 transitions. Word has length 71 [2021-12-18 01:33:12,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:12,232 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 2116 transitions. [2021-12-18 01:33:12,232 INFO L471 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) [2021-12-18 01:33:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2116 transitions. [2021-12-18 01:33:12,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-18 01:33:12,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:12,237 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:12,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 01:33:12,238 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:12,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:12,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2146869344, now seen corresponding path program 1 times [2021-12-18 01:33:12,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:12,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279604173] [2021-12-18 01:33:12,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:12,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:12,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:12,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 01:33:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:12,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-18 01:33:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:33:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:12,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:33:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:12,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:12,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:33:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:12,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 01:33:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:33:12,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:12,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279604173] [2021-12-18 01:33:12,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279604173] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:12,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:12,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 01:33:12,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802489567] [2021-12-18 01:33:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:12,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:33:12,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:12,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:33:12,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:33:12,434 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) [2021-12-18 01:33:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:14,242 INFO L93 Difference]: Finished difference Result 4036 states and 5567 transitions. [2021-12-18 01:33:14,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:33:14,243 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 [2021-12-18 01:33:14,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:14,256 INFO L225 Difference]: With dead ends: 4036 [2021-12-18 01:33:14,256 INFO L226 Difference]: Without dead ends: 2437 [2021-12-18 01:33:14,262 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:14,263 INFO L933 BasicCegarLoop]: 600 mSDtfsCounter, 437 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:14,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 1448 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-18 01:33:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2021-12-18 01:33:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2313. [2021-12-18 01:33:14,344 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) [2021-12-18 01:33:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3224 transitions. [2021-12-18 01:33:14,357 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3224 transitions. Word has length 71 [2021-12-18 01:33:14,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:14,357 INFO L470 AbstractCegarLoop]: Abstraction has 2313 states and 3224 transitions. [2021-12-18 01:33:14,358 INFO L471 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) [2021-12-18 01:33:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3224 transitions. [2021-12-18 01:33:14,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-18 01:33:14,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:14,360 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:14,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 01:33:14,360 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:14,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:14,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569613, now seen corresponding path program 1 times [2021-12-18 01:33:14,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:14,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204774001] [2021-12-18 01:33:14,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:14,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:14,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:14,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:14,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-18 01:33:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:14,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:14,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:14,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-18 01:33:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 01:33:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:33:14,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:14,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204774001] [2021-12-18 01:33:14,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204774001] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:14,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:14,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 01:33:14,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651546669] [2021-12-18 01:33:14,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:14,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:33:14,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:33:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:33:14,555 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) [2021-12-18 01:33:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:15,699 INFO L93 Difference]: Finished difference Result 6341 states and 9294 transitions. [2021-12-18 01:33:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:33:15,699 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 [2021-12-18 01:33:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:15,724 INFO L225 Difference]: With dead ends: 6341 [2021-12-18 01:33:15,724 INFO L226 Difference]: Without dead ends: 4040 [2021-12-18 01:33:15,734 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:15,734 INFO L933 BasicCegarLoop]: 865 mSDtfsCounter, 564 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:15,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 2765 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-18 01:33:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2021-12-18 01:33:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 2347. [2021-12-18 01:33:15,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) [2021-12-18 01:33:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3276 transitions. [2021-12-18 01:33:15,874 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3276 transitions. Word has length 68 [2021-12-18 01:33:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:15,875 INFO L470 AbstractCegarLoop]: Abstraction has 2347 states and 3276 transitions. [2021-12-18 01:33:15,875 INFO L471 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) [2021-12-18 01:33:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3276 transitions. [2021-12-18 01:33:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-18 01:33:15,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:15,877 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:15,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 01:33:15,878 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:15,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1776712988, now seen corresponding path program 1 times [2021-12-18 01:33:15,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:15,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650031377] [2021-12-18 01:33:15,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:15,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:15,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:15,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:15,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:15,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:16,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:33:16,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:16,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650031377] [2021-12-18 01:33:16,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650031377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:16,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:16,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 01:33:16,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030547726] [2021-12-18 01:33:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:16,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:33:16,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:16,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:33:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:33:16,026 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) [2021-12-18 01:33:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:17,151 INFO L93 Difference]: Finished difference Result 5919 states and 8590 transitions. [2021-12-18 01:33:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:33:17,151 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 [2021-12-18 01:33:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:17,174 INFO L225 Difference]: With dead ends: 5919 [2021-12-18 01:33:17,174 INFO L226 Difference]: Without dead ends: 3584 [2021-12-18 01:33:17,184 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:17,186 INFO L933 BasicCegarLoop]: 812 mSDtfsCounter, 453 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:17,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 2647 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-18 01:33:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2021-12-18 01:33:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 2363. [2021-12-18 01:33:17,349 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) [2021-12-18 01:33:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3292 transitions. [2021-12-18 01:33:17,358 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3292 transitions. Word has length 69 [2021-12-18 01:33:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:17,359 INFO L470 AbstractCegarLoop]: Abstraction has 2363 states and 3292 transitions. [2021-12-18 01:33:17,359 INFO L471 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) [2021-12-18 01:33:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3292 transitions. [2021-12-18 01:33:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-18 01:33:17,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:17,363 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:17,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 01:33:17,363 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:17,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:17,364 INFO L85 PathProgramCache]: Analyzing trace with hash 676145405, now seen corresponding path program 1 times [2021-12-18 01:33:17,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:17,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350369117] [2021-12-18 01:33:17,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:17,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:17,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:17,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:17,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:17,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:17,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:17,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:17,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:33:17,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:17,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350369117] [2021-12-18 01:33:17,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350369117] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:17,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:17,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 01:33:17,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225663598] [2021-12-18 01:33:17,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:17,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 01:33:17,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:17,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 01:33:17,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:33:17,694 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) [2021-12-18 01:33:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:18,974 INFO L93 Difference]: Finished difference Result 3619 states and 5113 transitions. [2021-12-18 01:33:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 01:33:18,975 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 [2021-12-18 01:33:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:18,986 INFO L225 Difference]: With dead ends: 3619 [2021-12-18 01:33:18,986 INFO L226 Difference]: Without dead ends: 2425 [2021-12-18 01:33:18,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-12-18 01:33:18,993 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 117 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 3216 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:18,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 3216 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-18 01:33:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2021-12-18 01:33:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2377. [2021-12-18 01:33:19,084 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) [2021-12-18 01:33:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3312 transitions. [2021-12-18 01:33:19,094 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3312 transitions. Word has length 69 [2021-12-18 01:33:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:19,095 INFO L470 AbstractCegarLoop]: Abstraction has 2377 states and 3312 transitions. [2021-12-18 01:33:19,096 INFO L471 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) [2021-12-18 01:33:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3312 transitions. [2021-12-18 01:33:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-18 01:33:19,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:19,098 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:19,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 01:33:19,099 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:19,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958436, now seen corresponding path program 1 times [2021-12-18 01:33:19,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:19,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195427174] [2021-12-18 01:33:19,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:19,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:33:19,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:19,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195427174] [2021-12-18 01:33:19,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195427174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:19,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:19,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 01:33:19,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805027636] [2021-12-18 01:33:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:19,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 01:33:19,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:19,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 01:33:19,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-18 01:33:19,306 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) [2021-12-18 01:33:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:20,696 INFO L93 Difference]: Finished difference Result 5577 states and 8014 transitions. [2021-12-18 01:33:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 01:33:20,697 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 [2021-12-18 01:33:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:20,713 INFO L225 Difference]: With dead ends: 5577 [2021-12-18 01:33:20,713 INFO L226 Difference]: Without dead ends: 3212 [2021-12-18 01:33:20,720 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:20,721 INFO L933 BasicCegarLoop]: 908 mSDtfsCounter, 448 mSDsluCounter, 6595 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 7503 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:20,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 7503 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-18 01:33:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2021-12-18 01:33:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 2381. [2021-12-18 01:33:20,816 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) [2021-12-18 01:33:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3312 transitions. [2021-12-18 01:33:20,825 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3312 transitions. Word has length 69 [2021-12-18 01:33:20,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:20,825 INFO L470 AbstractCegarLoop]: Abstraction has 2381 states and 3312 transitions. [2021-12-18 01:33:20,825 INFO L471 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) [2021-12-18 01:33:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3312 transitions. [2021-12-18 01:33:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 01:33:20,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:20,828 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:20,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 01:33:20,828 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:20,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1804654053, now seen corresponding path program 1 times [2021-12-18 01:33:20,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:20,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732002568] [2021-12-18 01:33:20,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:20,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:20,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:20,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:33:21,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:21,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732002568] [2021-12-18 01:33:21,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732002568] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:21,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:21,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 01:33:21,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708663800] [2021-12-18 01:33:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:21,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 01:33:21,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:21,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 01:33:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 01:33:21,096 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) [2021-12-18 01:33:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:22,436 INFO L93 Difference]: Finished difference Result 5739 states and 8248 transitions. [2021-12-18 01:33:22,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:33:22,436 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 [2021-12-18 01:33:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:22,456 INFO L225 Difference]: With dead ends: 5739 [2021-12-18 01:33:22,456 INFO L226 Difference]: Without dead ends: 3370 [2021-12-18 01:33:22,465 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:22,467 INFO L933 BasicCegarLoop]: 815 mSDtfsCounter, 397 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 4005 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:22,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 4005 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-18 01:33:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2021-12-18 01:33:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 2179. [2021-12-18 01:33:22,606 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) [2021-12-18 01:33:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2996 transitions. [2021-12-18 01:33:22,615 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 2996 transitions. Word has length 75 [2021-12-18 01:33:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:22,616 INFO L470 AbstractCegarLoop]: Abstraction has 2179 states and 2996 transitions. [2021-12-18 01:33:22,616 INFO L471 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) [2021-12-18 01:33:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2996 transitions. [2021-12-18 01:33:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 01:33:22,619 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:22,620 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:22,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 01:33:22,620 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash -506709307, now seen corresponding path program 1 times [2021-12-18 01:33:22,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:22,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919081489] [2021-12-18 01:33:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:22,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:22,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:22,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:22,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:22,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:22,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:33:22,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:22,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919081489] [2021-12-18 01:33:22,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919081489] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:22,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:22,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 01:33:22,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150933809] [2021-12-18 01:33:22,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:22,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 01:33:22,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 01:33:22,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:33:22,828 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) [2021-12-18 01:33:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:25,218 INFO L93 Difference]: Finished difference Result 3452 states and 4818 transitions. [2021-12-18 01:33:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 01:33:25,218 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 [2021-12-18 01:33:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:25,250 INFO L225 Difference]: With dead ends: 3452 [2021-12-18 01:33:25,250 INFO L226 Difference]: Without dead ends: 3447 [2021-12-18 01:33:25,252 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:25,253 INFO L933 BasicCegarLoop]: 919 mSDtfsCounter, 2406 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 1155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2520 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1155 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:25,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2520 Valid, 2334 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1155 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-18 01:33:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2021-12-18 01:33:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3363. [2021-12-18 01:33:25,390 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) [2021-12-18 01:33:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4685 transitions. [2021-12-18 01:33:25,403 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4685 transitions. Word has length 75 [2021-12-18 01:33:25,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:25,405 INFO L470 AbstractCegarLoop]: Abstraction has 3363 states and 4685 transitions. [2021-12-18 01:33:25,405 INFO L471 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) [2021-12-18 01:33:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4685 transitions. [2021-12-18 01:33:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-18 01:33:25,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:25,408 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:33:25,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 01:33:25,409 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash -418091033, now seen corresponding path program 1 times [2021-12-18 01:33:25,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:25,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512574738] [2021-12-18 01:33:25,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:25,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 01:33:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:33:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:33:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:33:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 01:33:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:33:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:33:25,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:25,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512574738] [2021-12-18 01:33:25,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512574738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:25,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:25,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 01:33:25,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007681423] [2021-12-18 01:33:25,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:25,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 01:33:25,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:25,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 01:33:25,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:33:25,693 INFO L87 Difference]: Start difference. First operand 3363 states and 4685 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 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) [2021-12-18 01:33:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:26,908 INFO L93 Difference]: Finished difference Result 7643 states and 10959 transitions. [2021-12-18 01:33:26,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 01:33:26,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 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 [2021-12-18 01:33:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:26,927 INFO L225 Difference]: With dead ends: 7643 [2021-12-18 01:33:26,927 INFO L226 Difference]: Without dead ends: 4292 [2021-12-18 01:33:26,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-12-18 01:33:26,937 INFO L933 BasicCegarLoop]: 798 mSDtfsCounter, 599 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:26,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [668 Valid, 3099 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-18 01:33:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2021-12-18 01:33:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 2826. [2021-12-18 01:33:27,086 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) [2021-12-18 01:33:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3941 transitions. [2021-12-18 01:33:27,098 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3941 transitions. Word has length 94 [2021-12-18 01:33:27,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:27,098 INFO L470 AbstractCegarLoop]: Abstraction has 2826 states and 3941 transitions. [2021-12-18 01:33:27,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 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) [2021-12-18 01:33:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3941 transitions. [2021-12-18 01:33:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-18 01:33:27,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:27,102 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:27,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 01:33:27,102 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash 564700489, now seen corresponding path program 1 times [2021-12-18 01:33:27,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:27,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338120394] [2021-12-18 01:33:27,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:27,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 01:33:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:33:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:33:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:33:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 01:33:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 01:33:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 01:33:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 01:33:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:33:27,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:27,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338120394] [2021-12-18 01:33:27,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338120394] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:27,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:27,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 01:33:27,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855593458] [2021-12-18 01:33:27,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:27,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 01:33:27,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:27,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 01:33:27,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:33:27,384 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) [2021-12-18 01:33:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:28,938 INFO L93 Difference]: Finished difference Result 6776 states and 9771 transitions. [2021-12-18 01:33:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 01:33:28,939 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 [2021-12-18 01:33:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:28,951 INFO L225 Difference]: With dead ends: 6776 [2021-12-18 01:33:28,952 INFO L226 Difference]: Without dead ends: 4370 [2021-12-18 01:33:28,961 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:28,961 INFO L933 BasicCegarLoop]: 804 mSDtfsCounter, 433 mSDsluCounter, 6178 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 6982 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:28,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 6982 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-18 01:33:28,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2021-12-18 01:33:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 2826. [2021-12-18 01:33:29,096 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) [2021-12-18 01:33:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3933 transitions. [2021-12-18 01:33:29,107 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3933 transitions. Word has length 92 [2021-12-18 01:33:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:29,107 INFO L470 AbstractCegarLoop]: Abstraction has 2826 states and 3933 transitions. [2021-12-18 01:33:29,107 INFO L471 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) [2021-12-18 01:33:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3933 transitions. [2021-12-18 01:33:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-18 01:33:29,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:29,110 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:29,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 01:33:29,111 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:29,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1871827029, now seen corresponding path program 1 times [2021-12-18 01:33:29,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:29,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166065893] [2021-12-18 01:33:29,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:29,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:29,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:29,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:29,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:29,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:29,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:29,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:29,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:29,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:29,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-18 01:33:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:33:29,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:29,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166065893] [2021-12-18 01:33:29,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166065893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:29,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:29,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 01:33:29,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580657409] [2021-12-18 01:33:29,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:29,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 01:33:29,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:29,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 01:33:29,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 01:33:29,347 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) [2021-12-18 01:33:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:30,343 INFO L93 Difference]: Finished difference Result 6262 states and 9007 transitions. [2021-12-18 01:33:30,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 01:33:30,343 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 [2021-12-18 01:33:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:30,358 INFO L225 Difference]: With dead ends: 6262 [2021-12-18 01:33:30,358 INFO L226 Difference]: Without dead ends: 3856 [2021-12-18 01:33:30,367 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:30,368 INFO L933 BasicCegarLoop]: 810 mSDtfsCounter, 513 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:30,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 3134 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-18 01:33:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2021-12-18 01:33:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 2636. [2021-12-18 01:33:30,527 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) [2021-12-18 01:33:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3635 transitions. [2021-12-18 01:33:30,536 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3635 transitions. Word has length 87 [2021-12-18 01:33:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:30,536 INFO L470 AbstractCegarLoop]: Abstraction has 2636 states and 3635 transitions. [2021-12-18 01:33:30,536 INFO L471 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) [2021-12-18 01:33:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3635 transitions. [2021-12-18 01:33:30,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-18 01:33:30,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:30,539 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:30,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 01:33:30,540 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:30,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:30,540 INFO L85 PathProgramCache]: Analyzing trace with hash -205382314, now seen corresponding path program 1 times [2021-12-18 01:33:30,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:30,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017520156] [2021-12-18 01:33:30,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:30,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:30,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:30,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:30,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:30,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:30,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:30,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-18 01:33:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:33:30,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:30,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017520156] [2021-12-18 01:33:30,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017520156] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:30,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:30,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 01:33:30,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989223139] [2021-12-18 01:33:30,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:30,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 01:33:30,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:30,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 01:33:30,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-18 01:33:30,810 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) [2021-12-18 01:33:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:31,843 INFO L93 Difference]: Finished difference Result 3905 states and 5433 transitions. [2021-12-18 01:33:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 01:33:31,843 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 [2021-12-18 01:33:31,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:31,851 INFO L225 Difference]: With dead ends: 3905 [2021-12-18 01:33:31,852 INFO L226 Difference]: Without dead ends: 2681 [2021-12-18 01:33:31,856 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:31,856 INFO L933 BasicCegarLoop]: 527 mSDtfsCounter, 340 mSDsluCounter, 2383 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 2910 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:31,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 2910 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-18 01:33:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2021-12-18 01:33:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2644. [2021-12-18 01:33:32,008 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) [2021-12-18 01:33:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3643 transitions. [2021-12-18 01:33:32,018 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3643 transitions. Word has length 87 [2021-12-18 01:33:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:32,019 INFO L470 AbstractCegarLoop]: Abstraction has 2644 states and 3643 transitions. [2021-12-18 01:33:32,019 INFO L471 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) [2021-12-18 01:33:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3643 transitions. [2021-12-18 01:33:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-18 01:33:32,022 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:32,022 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:32,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 01:33:32,023 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:32,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:32,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2079481141, now seen corresponding path program 1 times [2021-12-18 01:33:32,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:32,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203564761] [2021-12-18 01:33:32,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:32,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-18 01:33:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:33:32,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:32,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203564761] [2021-12-18 01:33:32,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203564761] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:32,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:32,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 01:33:32,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962883184] [2021-12-18 01:33:32,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:32,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:33:32,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:32,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:33:32,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:33:32,183 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) [2021-12-18 01:33:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:33,138 INFO L93 Difference]: Finished difference Result 4660 states and 6627 transitions. [2021-12-18 01:33:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:33:33,139 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 [2021-12-18 01:33:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:33,150 INFO L225 Difference]: With dead ends: 4660 [2021-12-18 01:33:33,150 INFO L226 Difference]: Without dead ends: 3432 [2021-12-18 01:33:33,156 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:33,157 INFO L933 BasicCegarLoop]: 831 mSDtfsCounter, 426 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:33,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 2184 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-18 01:33:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2021-12-18 01:33:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2652. [2021-12-18 01:33:33,311 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) [2021-12-18 01:33:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3651 transitions. [2021-12-18 01:33:33,319 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3651 transitions. Word has length 87 [2021-12-18 01:33:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:33,320 INFO L470 AbstractCegarLoop]: Abstraction has 2652 states and 3651 transitions. [2021-12-18 01:33:33,320 INFO L471 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) [2021-12-18 01:33:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3651 transitions. [2021-12-18 01:33:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-18 01:33:33,324 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:33,324 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:33,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 01:33:33,324 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:33,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:33,325 INFO L85 PathProgramCache]: Analyzing trace with hash 390816807, now seen corresponding path program 1 times [2021-12-18 01:33:33,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:33,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897232805] [2021-12-18 01:33:33,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:33,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:33:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-18 01:33:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 01:33:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 01:33:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 01:33:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:33:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-18 01:33:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 01:33:33,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:33,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897232805] [2021-12-18 01:33:33,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897232805] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:33,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:33,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 01:33:33,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749345227] [2021-12-18 01:33:33,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:33,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:33:33,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:33,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:33:33,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:33:33,483 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) [2021-12-18 01:33:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:35,401 INFO L93 Difference]: Finished difference Result 5424 states and 7473 transitions. [2021-12-18 01:33:35,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:33:35,401 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 [2021-12-18 01:33:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:35,412 INFO L225 Difference]: With dead ends: 5424 [2021-12-18 01:33:35,412 INFO L226 Difference]: Without dead ends: 2778 [2021-12-18 01:33:35,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:33:35,422 INFO L933 BasicCegarLoop]: 539 mSDtfsCounter, 247 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:35,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 1825 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-18 01:33:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2021-12-18 01:33:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2664. [2021-12-18 01:33:35,535 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) [2021-12-18 01:33:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3662 transitions. [2021-12-18 01:33:35,546 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3662 transitions. Word has length 94 [2021-12-18 01:33:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:35,546 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 3662 transitions. [2021-12-18 01:33:35,546 INFO L471 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) [2021-12-18 01:33:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3662 transitions. [2021-12-18 01:33:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-18 01:33:35,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:35,549 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:35,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 01:33:35,549 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:35,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:35,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1118734186, now seen corresponding path program 1 times [2021-12-18 01:33:35,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:35,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131680206] [2021-12-18 01:33:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:35,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:35,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:35,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:35,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:35,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:35,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:35,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:35,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:35,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 01:33:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:33:35,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:35,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131680206] [2021-12-18 01:33:35,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131680206] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:35,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:35,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 01:33:35,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377451205] [2021-12-18 01:33:35,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:35,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 01:33:35,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:35,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 01:33:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:33:35,775 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) [2021-12-18 01:33:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:38,013 INFO L93 Difference]: Finished difference Result 3982 states and 5507 transitions. [2021-12-18 01:33:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 01:33:38,014 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 [2021-12-18 01:33:38,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:38,027 INFO L225 Difference]: With dead ends: 3982 [2021-12-18 01:33:38,027 INFO L226 Difference]: Without dead ends: 3979 [2021-12-18 01:33:38,030 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:38,030 INFO L933 BasicCegarLoop]: 1000 mSDtfsCounter, 2074 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 2914 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:38,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2205 Valid, 2914 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-18 01:33:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2021-12-18 01:33:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3879. [2021-12-18 01:33:38,224 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) [2021-12-18 01:33:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 5379 transitions. [2021-12-18 01:33:38,238 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 5379 transitions. Word has length 89 [2021-12-18 01:33:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:38,238 INFO L470 AbstractCegarLoop]: Abstraction has 3879 states and 5379 transitions. [2021-12-18 01:33:38,238 INFO L471 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) [2021-12-18 01:33:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 5379 transitions. [2021-12-18 01:33:38,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-18 01:33:38,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:38,241 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:38,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 01:33:38,242 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:38,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1748979270, now seen corresponding path program 1 times [2021-12-18 01:33:38,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:38,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162004053] [2021-12-18 01:33:38,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:38,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 01:33:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-18 01:33:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:33:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:33:38,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:38,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162004053] [2021-12-18 01:33:38,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162004053] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:33:38,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211085199] [2021-12-18 01:33:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:38,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:38,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:38,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 01:33:38,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 01:33:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:39,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-18 01:33:39,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:33:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:33:39,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:33:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:33:39,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211085199] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:33:39,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:33:39,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2021-12-18 01:33:39,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654959592] [2021-12-18 01:33:39,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:33:39,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-18 01:33:39,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:39,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-18 01:33:39,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2021-12-18 01:33:39,679 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) [2021-12-18 01:33:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:43,776 INFO L93 Difference]: Finished difference Result 11133 states and 16255 transitions. [2021-12-18 01:33:43,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-18 01:33:43,776 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 [2021-12-18 01:33:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:43,835 INFO L225 Difference]: With dead ends: 11133 [2021-12-18 01:33:43,835 INFO L226 Difference]: Without dead ends: 7266 [2021-12-18 01:33:43,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=1715, Unknown=0, NotChecked=0, Total=1892 [2021-12-18 01:33:43,850 INFO L933 BasicCegarLoop]: 940 mSDtfsCounter, 1002 mSDsluCounter, 16697 mSDsCounter, 0 mSdLazyCounter, 3931 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 17637 SdHoareTripleChecker+Invalid, 4499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 3931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:43,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1065 Valid, 17637 Invalid, 4499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 3931 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-18 01:33:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7266 states. [2021-12-18 01:33:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7266 to 3833. [2021-12-18 01:33:44,070 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) [2021-12-18 01:33:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 5271 transitions. [2021-12-18 01:33:44,082 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 5271 transitions. Word has length 94 [2021-12-18 01:33:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:44,083 INFO L470 AbstractCegarLoop]: Abstraction has 3833 states and 5271 transitions. [2021-12-18 01:33:44,083 INFO L471 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) [2021-12-18 01:33:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 5271 transitions. [2021-12-18 01:33:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-18 01:33:44,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:44,085 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:44,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 01:33:44,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-18 01:33:44,299 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:44,300 INFO L85 PathProgramCache]: Analyzing trace with hash -448437055, now seen corresponding path program 1 times [2021-12-18 01:33:44,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:44,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689186878] [2021-12-18 01:33:44,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:44,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 01:33:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 01:33:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 01:33:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 01:33:44,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:44,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689186878] [2021-12-18 01:33:44,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689186878] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:44,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:44,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 01:33:44,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125963620] [2021-12-18 01:33:44,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:44,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 01:33:44,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:44,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 01:33:44,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-18 01:33:44,607 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) [2021-12-18 01:33:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:47,358 INFO L93 Difference]: Finished difference Result 10144 states and 13936 transitions. [2021-12-18 01:33:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 01:33:47,359 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 [2021-12-18 01:33:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:47,386 INFO L225 Difference]: With dead ends: 10144 [2021-12-18 01:33:47,387 INFO L226 Difference]: Without dead ends: 8384 [2021-12-18 01:33:47,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-12-18 01:33:47,397 INFO L933 BasicCegarLoop]: 908 mSDtfsCounter, 1947 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 2537 mSolverCounterSat, 890 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 3776 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 890 IncrementalHoareTripleChecker+Valid, 2537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:47,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2062 Valid, 3776 Invalid, 3427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [890 Valid, 2537 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-18 01:33:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8384 states. [2021-12-18 01:33:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8384 to 8132. [2021-12-18 01:33:47,834 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) [2021-12-18 01:33:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 11181 transitions. [2021-12-18 01:33:47,868 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 11181 transitions. Word has length 96 [2021-12-18 01:33:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:47,869 INFO L470 AbstractCegarLoop]: Abstraction has 8132 states and 11181 transitions. [2021-12-18 01:33:47,869 INFO L471 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) [2021-12-18 01:33:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 11181 transitions. [2021-12-18 01:33:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-18 01:33:47,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:47,872 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:47,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-18 01:33:47,873 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:47,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:47,873 INFO L85 PathProgramCache]: Analyzing trace with hash 832679025, now seen corresponding path program 1 times [2021-12-18 01:33:47,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:47,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222607410] [2021-12-18 01:33:47,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:47,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:47,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:47,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:47,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:47,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:47,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:47,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:48,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:48,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:48,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 01:33:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:48,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 01:33:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:48,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 01:33:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:33:48,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:48,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222607410] [2021-12-18 01:33:48,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222607410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:48,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:48,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-18 01:33:48,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52658368] [2021-12-18 01:33:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:48,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 01:33:48,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:48,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 01:33:48,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-18 01:33:48,099 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) [2021-12-18 01:33:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:50,504 INFO L93 Difference]: Finished difference Result 17611 states and 24834 transitions. [2021-12-18 01:33:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 01:33:50,505 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 [2021-12-18 01:33:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:50,548 INFO L225 Difference]: With dead ends: 17611 [2021-12-18 01:33:50,548 INFO L226 Difference]: Without dead ends: 10847 [2021-12-18 01:33:50,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-12-18 01:33:50,571 INFO L933 BasicCegarLoop]: 812 mSDtfsCounter, 462 mSDsluCounter, 6859 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 7671 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:50,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [539 Valid, 7671 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-18 01:33:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10847 states. [2021-12-18 01:33:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10847 to 8126. [2021-12-18 01:33:51,035 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) [2021-12-18 01:33:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 11151 transitions. [2021-12-18 01:33:51,070 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 11151 transitions. Word has length 97 [2021-12-18 01:33:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:51,071 INFO L470 AbstractCegarLoop]: Abstraction has 8126 states and 11151 transitions. [2021-12-18 01:33:51,071 INFO L471 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) [2021-12-18 01:33:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 11151 transitions. [2021-12-18 01:33:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-18 01:33:51,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:51,075 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:51,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-18 01:33:51,075 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:51,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:51,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1118058599, now seen corresponding path program 1 times [2021-12-18 01:33:51,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:51,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465328526] [2021-12-18 01:33:51,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:51,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:33:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:33:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 01:33:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 01:33:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 01:33:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 01:33:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 01:33:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 01:33:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-18 01:33:51,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:51,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465328526] [2021-12-18 01:33:51,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465328526] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:33:51,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144228028] [2021-12-18 01:33:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:51,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:51,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:51,330 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 01:33:51,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 01:33:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 01:33:51,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:33:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 01:33:51,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:33:51,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144228028] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:51,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:33:51,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2021-12-18 01:33:51,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420824333] [2021-12-18 01:33:51,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:51,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:33:51,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:51,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:33:51,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-18 01:33:51,961 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) [2021-12-18 01:33:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:52,279 INFO L93 Difference]: Finished difference Result 16288 states and 22354 transitions. [2021-12-18 01:33:52,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:33:52,280 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 [2021-12-18 01:33:52,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:52,309 INFO L225 Difference]: With dead ends: 16288 [2021-12-18 01:33:52,309 INFO L226 Difference]: Without dead ends: 8174 [2021-12-18 01:33:52,330 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:52,330 INFO L933 BasicCegarLoop]: 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 [2021-12-18 01:33:52,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 1083 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:33:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8174 states. [2021-12-18 01:33:52,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8174 to 8158. [2021-12-18 01:33:52,784 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) [2021-12-18 01:33:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 11183 transitions. [2021-12-18 01:33:52,813 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 11183 transitions. Word has length 108 [2021-12-18 01:33:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:52,814 INFO L470 AbstractCegarLoop]: Abstraction has 8158 states and 11183 transitions. [2021-12-18 01:33:52,814 INFO L471 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) [2021-12-18 01:33:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 11183 transitions. [2021-12-18 01:33:52,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-18 01:33:52,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:52,817 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:52,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-18 01:33:53,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-18 01:33:53,031 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash 920282283, now seen corresponding path program 1 times [2021-12-18 01:33:53,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:53,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015366513] [2021-12-18 01:33:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:53,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 01:33:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:33:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:33:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:33:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 01:33:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:33:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-18 01:33:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 01:33:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 01:33:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 01:33:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-18 01:33:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 01:33:53,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015366513] [2021-12-18 01:33:53,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015366513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:53,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:53,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 01:33:53,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749443851] [2021-12-18 01:33:53,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:53,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 01:33:53,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:53,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 01:33:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-18 01:33:53,278 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) [2021-12-18 01:33:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:57,820 INFO L93 Difference]: Finished difference Result 18980 states and 26789 transitions. [2021-12-18 01:33:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 01:33:57,822 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 [2021-12-18 01:33:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:57,855 INFO L225 Difference]: With dead ends: 18980 [2021-12-18 01:33:57,856 INFO L226 Difference]: Without dead ends: 12202 [2021-12-18 01:33:57,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-12-18 01:33:57,876 INFO L933 BasicCegarLoop]: 791 mSDtfsCounter, 505 mSDsluCounter, 3286 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 4077 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:57,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 4077 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2021-12-18 01:33:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12202 states. [2021-12-18 01:33:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12202 to 7987. [2021-12-18 01:33:58,326 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) [2021-12-18 01:33:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7987 states to 7987 states and 10938 transitions. [2021-12-18 01:33:58,356 INFO L78 Accepts]: Start accepts. Automaton has 7987 states and 10938 transitions. Word has length 120 [2021-12-18 01:33:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:58,357 INFO L470 AbstractCegarLoop]: Abstraction has 7987 states and 10938 transitions. [2021-12-18 01:33:58,357 INFO L471 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) [2021-12-18 01:33:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7987 states and 10938 transitions. [2021-12-18 01:33:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-18 01:33:58,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:58,360 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:58,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-18 01:33:58,361 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:58,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:58,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2053204873, now seen corresponding path program 1 times [2021-12-18 01:33:58,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:58,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118682501] [2021-12-18 01:33:58,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:58,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 01:33:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-18 01:33:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 01:33:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 01:33:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 01:33:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:33:58,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:58,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118682501] [2021-12-18 01:33:58,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118682501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:58,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:58,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-18 01:33:58,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710583742] [2021-12-18 01:33:58,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:58,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 01:33:58,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 01:33:58,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-12-18 01:33:58,625 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) [2021-12-18 01:34:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:00,952 INFO L93 Difference]: Finished difference Result 15028 states and 21199 transitions. [2021-12-18 01:34:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-18 01:34:00,952 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 [2021-12-18 01:34:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:00,978 INFO L225 Difference]: With dead ends: 15028 [2021-12-18 01:34:00,978 INFO L226 Difference]: Without dead ends: 10127 [2021-12-18 01:34:00,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2021-12-18 01:34:00,993 INFO L933 BasicCegarLoop]: 798 mSDtfsCounter, 559 mSDsluCounter, 6640 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 7438 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:00,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [635 Valid, 7438 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-18 01:34:01,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10127 states. [2021-12-18 01:34:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10127 to 7133. [2021-12-18 01:34:01,322 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) [2021-12-18 01:34:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 9709 transitions. [2021-12-18 01:34:01,352 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 9709 transitions. Word has length 104 [2021-12-18 01:34:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:01,353 INFO L470 AbstractCegarLoop]: Abstraction has 7133 states and 9709 transitions. [2021-12-18 01:34:01,353 INFO L471 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) [2021-12-18 01:34:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 9709 transitions. [2021-12-18 01:34:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-18 01:34:01,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:01,356 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:01,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-18 01:34:01,357 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:01,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1247847667, now seen corresponding path program 1 times [2021-12-18 01:34:01,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:34:01,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521464258] [2021-12-18 01:34:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:01,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:34:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:34:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:34:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:34:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 01:34:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:34:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 01:34:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 01:34:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 01:34:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 01:34:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:34:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 01:34:01,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:34:01,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521464258] [2021-12-18 01:34:01,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521464258] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:34:01,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330208907] [2021-12-18 01:34:01,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:01,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:34:01,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:34:01,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 01:34:01,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 01:34:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:02,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 01:34:02,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 01:34:02,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:34:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 01:34:02,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330208907] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:34:02,523 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:34:02,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2021-12-18 01:34:02,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194293672] [2021-12-18 01:34:02,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:34:02,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 01:34:02,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:34:02,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 01:34:02,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:34:02,525 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) [2021-12-18 01:34:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:05,948 INFO L93 Difference]: Finished difference Result 14665 states and 19980 transitions. [2021-12-18 01:34:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 01:34:05,949 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 [2021-12-18 01:34:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:05,972 INFO L225 Difference]: With dead ends: 14665 [2021-12-18 01:34:05,973 INFO L226 Difference]: Without dead ends: 7538 [2021-12-18 01:34:05,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-12-18 01:34:05,994 INFO L933 BasicCegarLoop]: 530 mSDtfsCounter, 243 mSDsluCounter, 3208 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 3738 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:05,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 3738 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-18 01:34:06,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2021-12-18 01:34:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 7268. [2021-12-18 01:34:06,492 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) [2021-12-18 01:34:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 9842 transitions. [2021-12-18 01:34:06,513 INFO L78 Accepts]: Start accepts. Automaton has 7268 states and 9842 transitions. Word has length 111 [2021-12-18 01:34:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:06,513 INFO L470 AbstractCegarLoop]: Abstraction has 7268 states and 9842 transitions. [2021-12-18 01:34:06,514 INFO L471 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) [2021-12-18 01:34:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 7268 states and 9842 transitions. [2021-12-18 01:34:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-18 01:34:06,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:06,517 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:06,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:06,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:34:06,732 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash 800394672, now seen corresponding path program 1 times [2021-12-18 01:34:06,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:34:06,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462434510] [2021-12-18 01:34:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:06,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:34:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:34:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 01:34:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:34:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:34:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:34:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 01:34:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:34:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-18 01:34:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 01:34:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-18 01:34:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 01:34:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:34:07,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:34:07,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462434510] [2021-12-18 01:34:07,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462434510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:07,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:07,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-18 01:34:07,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300173663] [2021-12-18 01:34:07,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:07,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 01:34:07,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:34:07,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 01:34:07,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-12-18 01:34:07,004 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) [2021-12-18 01:34:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:09,178 INFO L93 Difference]: Finished difference Result 13334 states and 18523 transitions. [2021-12-18 01:34:09,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 01:34:09,178 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 [2021-12-18 01:34:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:09,205 INFO L225 Difference]: With dead ends: 13334 [2021-12-18 01:34:09,205 INFO L226 Difference]: Without dead ends: 10002 [2021-12-18 01:34:09,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-12-18 01:34:09,217 INFO L933 BasicCegarLoop]: 766 mSDtfsCounter, 655 mSDsluCounter, 6119 mSDsCounter, 0 mSdLazyCounter, 1811 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 6885 SdHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 1811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:09,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 6885 Invalid, 2314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 1811 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-18 01:34:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10002 states. [2021-12-18 01:34:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10002 to 7266. [2021-12-18 01:34:09,632 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) [2021-12-18 01:34:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7266 states to 7266 states and 9824 transitions. [2021-12-18 01:34:09,656 INFO L78 Accepts]: Start accepts. Automaton has 7266 states and 9824 transitions. Word has length 121 [2021-12-18 01:34:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:09,657 INFO L470 AbstractCegarLoop]: Abstraction has 7266 states and 9824 transitions. [2021-12-18 01:34:09,657 INFO L471 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) [2021-12-18 01:34:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 7266 states and 9824 transitions. [2021-12-18 01:34:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-18 01:34:09,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:09,661 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:09,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-18 01:34:09,661 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1117139730, now seen corresponding path program 1 times [2021-12-18 01:34:09,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:34:09,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701288511] [2021-12-18 01:34:09,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:09,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:34:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 01:34:09,801 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 01:34:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 01:34:09,969 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 01:34:09,969 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 01:34:09,970 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 01:34:09,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-18 01:34:09,976 INFO L732 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] [2021-12-18 01:34:09,979 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 01:34:10,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:34:10 BoogieIcfgContainer [2021-12-18 01:34:10,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 01:34:10,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 01:34:10,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 01:34:10,117 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 01:34:10,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:33:08" (3/4) ... [2021-12-18 01:34:10,120 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 01:34:10,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 01:34:10,121 INFO L158 Benchmark]: Toolchain (without parser) took 65918.02ms. Allocated memory was 96.5MB in the beginning and 1.1GB in the end (delta: 985.7MB). Free memory was 56.3MB in the beginning and 376.2MB in the end (delta: -319.8MB). Peak memory consumption was 665.9MB. Max. memory is 16.1GB. [2021-12-18 01:34:10,121 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 01:34:10,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1544.50ms. Allocated memory was 96.5MB in the beginning and 155.2MB in the end (delta: 58.7MB). Free memory was 56.0MB in the beginning and 92.6MB in the end (delta: -36.6MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2021-12-18 01:34:10,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.98ms. Allocated memory is still 155.2MB. Free memory was 92.6MB in the beginning and 83.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 01:34:10,122 INFO L158 Benchmark]: Boogie Preprocessor took 159.76ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 73.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-18 01:34:10,123 INFO L158 Benchmark]: RCFGBuilder took 2399.12ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 73.7MB in the beginning and 103.5MB in the end (delta: -29.8MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2021-12-18 01:34:10,124 INFO L158 Benchmark]: TraceAbstraction took 61712.53ms. Allocated memory was 197.1MB in the beginning and 1.1GB in the end (delta: 885.0MB). Free memory was 103.5MB in the beginning and 377.2MB in the end (delta: -273.7MB). Peak memory consumption was 610.2MB. Max. memory is 16.1GB. [2021-12-18 01:34:10,125 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 1.1GB. Free memory was 377.2MB in the beginning and 376.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 01:34:10,134 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1544.50ms. Allocated memory was 96.5MB in the beginning and 155.2MB in the end (delta: 58.7MB). Free memory was 56.0MB in the beginning and 92.6MB in the end (delta: -36.6MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.98ms. Allocated memory is still 155.2MB. Free memory was 92.6MB in the beginning and 83.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 159.76ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 73.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2399.12ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 73.7MB in the beginning and 103.5MB in the end (delta: -29.8MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 61712.53ms. Allocated memory was 197.1MB in the beginning and 1.1GB in the end (delta: 885.0MB). Free memory was 103.5MB in the beginning and 377.2MB in the end (delta: -273.7MB). Peak memory consumption was 610.2MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 1.1GB. Free memory was 377.2MB in the beginning and 376.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 large string literal at line 5143, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={18446744073709551617:0}, skb={18446744073709551617:0}] [L6066] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551623:18446744073709551618}, dev={0:-519}, 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={18446744073709551623:18446744073709551618}, dev={0:-519}, dev={0:-519}, 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={18446744073709551623:18446744073709551618}, 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:-519}, netdev={0:-519}, 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={18446744073709551617:0}, skb={18446744073709551617: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={18446744073709551623:18446744073709551618}, cf={-18446744073709551617:-8}, dev={0:-519}, dev={0:-519}, 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={18446744073709551617:0}, skb={18446744073709551617: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={18446744073709551623:18446744073709551618}, cf={-18446744073709551617:-8}, cf->can_dlc=0, dev={0:-519}, dev={0:-519}, 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={18446744073709551617:0}, skb={18446744073709551617: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={18446744073709551623:18446744073709551618}, cf={-18446744073709551617:-8}, dev={0:-519}, dev={0:-519}, 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={18446744073709551617:0}, skb={18446744073709551617:0}, tmp___7=0] [L5266] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551623:18446744073709551618}, cf={-18446744073709551617:-8}, dev={0:-519}, dev={0:-519}, 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={18446744073709551617:0}, skb={18446744073709551617: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={18446744073709551623:18446744073709551618}, cf={-18446744073709551617:-8}, dev={0:-519}, dev={0:-519}, 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={18446744073709551617:0}, skb={18446744073709551617: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={18446744073709551623:18446744073709551618}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, cf={-18446744073709551617:-8}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551626:18446744073709551633}, 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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, dev={18446744073709551626:18446744073709551633}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, dev={18446744073709551626:18446744073709551633}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, dev={18446744073709551626:18446744073709551633}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, arbitrary_memory={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551633}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, arbitrary_memory={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551633}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, cf={-18446744073709551617:-8}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551626:18446744073709551633}, 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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-8}, cf->can_id=18446744073709551622, 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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-8}, cf->can_id=18446744073709551622, 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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-8}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551626:18446744073709551633}, 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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551633}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551633}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551633}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551633}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551626:18446744073709551633}, dev={18446744073709551626:18446744073709551633}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-8}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551626:18446744073709551633}, 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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, buf={-18446744073709551617:0}, cf={-18446744073709551617:-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:-519}, netdev={0:-519}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={18446744073709551617:0}, skb={18446744073709551617:0}, stats={0:-331}, 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={18446744073709551623:18446744073709551618}, 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:-519}, var_group2={18446744073709551617:0}] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND FALSE !(\read(tmp___9)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551623:18446744073709551618}, 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:-519}, var_group2={18446744073709551617: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={18446744073709551623:18446744073709551618}, 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:-519}, var_group2={18446744073709551617:0}] [L6650] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551623:18446744073709551618}, 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:-519}, var_group2={18446744073709551617:0}] [L6742] CALL ems_usb_exit() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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:-519}, var_group2={18446744073709551617: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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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={18446744073709551623:18446744073709551618}, 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: 61.5s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 45.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17412 SdHoareTripleChecker+Valid, 37.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16143 mSDsluCounter, 103879 SdHoareTripleChecker+Invalid, 33.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85173 mSDsCounter, 8258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27543 IncrementalHoareTripleChecker+Invalid, 35801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8258 mSolverCounterUnsat, 18706 mSDtfsCounter, 27543 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1285 GetRequests, 972 SyntacticMatches, 3 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 2.6s 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: 5.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 27213 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2500 NumberOfCodeBlocks, 2500 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2569 ConstructedInterpolants, 0 QuantifiedInterpolants, 4843 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4451 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 [2021-12-18 01:34:10,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 01:34:12,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 01:34:12,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 01:34:12,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 01:34:12,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 01:34:12,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 01:34:12,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 01:34:12,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 01:34:12,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 01:34:12,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 01:34:12,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 01:34:12,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 01:34:12,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 01:34:12,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 01:34:12,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 01:34:12,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 01:34:12,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 01:34:12,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 01:34:12,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 01:34:12,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 01:34:12,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 01:34:12,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 01:34:12,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 01:34:12,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 01:34:12,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 01:34:12,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 01:34:12,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 01:34:12,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 01:34:12,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 01:34:12,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 01:34:12,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 01:34:12,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 01:34:12,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 01:34:12,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 01:34:12,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 01:34:12,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 01:34:12,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 01:34:12,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 01:34:12,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 01:34:12,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 01:34:12,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 01:34:12,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-12-18 01:34:12,282 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 01:34:12,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 01:34:12,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 01:34:12,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 01:34:12,283 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 01:34:12,284 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 01:34:12,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 01:34:12,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 01:34:12,285 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 01:34:12,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 01:34:12,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 01:34:12,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 01:34:12,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 01:34:12,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 01:34:12,287 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 01:34:12,287 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 01:34:12,288 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 01:34:12,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 01:34:12,288 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 01:34:12,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 01:34:12,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 01:34:12,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 01:34:12,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 01:34:12,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:34:12,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 01:34:12,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 01:34:12,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 01:34:12,290 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 01:34:12,290 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 01:34:12,290 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 01:34:12,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 01:34:12,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 01:34:12,291 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 01:34:12,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 01:34:12,291 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2021-12-18 01:34:12,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 01:34:12,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 01:34:12,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 01:34:12,651 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 01:34:12,652 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 01:34:12,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-12-18 01:34:12,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a24872b/f0734db76b044fa18c0e6abc6b262113/FLAGe893125f9 [2021-12-18 01:34:13,393 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 01:34:13,393 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-12-18 01:34:13,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a24872b/f0734db76b044fa18c0e6abc6b262113/FLAGe893125f9 [2021-12-18 01:34:13,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a24872b/f0734db76b044fa18c0e6abc6b262113 [2021-12-18 01:34:13,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 01:34:13,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 01:34:13,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 01:34:13,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 01:34:13,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 01:34:13,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:34:13" (1/1) ... [2021-12-18 01:34:13,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40221471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:13, skipping insertion in model container [2021-12-18 01:34:13,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:34:13" (1/1) ... [2021-12-18 01:34:13,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 01:34:13,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 01:34:14,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-12-18 01:34:14,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:34:14,777 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-18 01:34:14,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 01:34:15,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-12-18 01:34:15,031 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:34:15,044 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 01:34:15,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-12-18 01:34:15,291 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:34:15,496 INFO L208 MainTranslator]: Completed translation [2021-12-18 01:34:15,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15 WrapperNode [2021-12-18 01:34:15,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 01:34:15,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 01:34:15,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 01:34:15,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 01:34:15,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15" (1/1) ... [2021-12-18 01:34:15,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15" (1/1) ... [2021-12-18 01:34:15,657 INFO L137 Inliner]: procedures = 148, calls = 733, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1342 [2021-12-18 01:34:15,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 01:34:15,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 01:34:15,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 01:34:15,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 01:34:15,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15" (1/1) ... [2021-12-18 01:34:15,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15" (1/1) ... [2021-12-18 01:34:15,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15" (1/1) ... [2021-12-18 01:34:15,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15" (1/1) ... [2021-12-18 01:34:15,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15" (1/1) ... [2021-12-18 01:34:15,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15" (1/1) ... [2021-12-18 01:34:15,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15" (1/1) ... [2021-12-18 01:34:15,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 01:34:15,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 01:34:15,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 01:34:15,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 01:34:15,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15" (1/1) ... [2021-12-18 01:34:15,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:34:15,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:34:15,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 01:34:15,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 01:34:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2021-12-18 01:34:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2021-12-18 01:34:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-18 01:34:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2021-12-18 01:34:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2021-12-18 01:34:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2021-12-18 01:34:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2021-12-18 01:34:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-12-18 01:34:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 01:34:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 01:34:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 01:34:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2021-12-18 01:34:15,869 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2021-12-18 01:34:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2021-12-18 01:34:15,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2021-12-18 01:34:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-12-18 01:34:15,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-12-18 01:34:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 01:34:15,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 01:34:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2021-12-18 01:34:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2021-12-18 01:34:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2021-12-18 01:34:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2021-12-18 01:34:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-18 01:34:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-18 01:34:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2021-12-18 01:34:15,872 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2021-12-18 01:34:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2021-12-18 01:34:15,872 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2021-12-18 01:34:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2021-12-18 01:34:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2021-12-18 01:34:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-12-18 01:34:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-12-18 01:34:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-12-18 01:34:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-12-18 01:34:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2021-12-18 01:34:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2021-12-18 01:34:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-12-18 01:34:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-12-18 01:34:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2021-12-18 01:34:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2021-12-18 01:34:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 01:34:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2021-12-18 01:34:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2021-12-18 01:34:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 01:34:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2021-12-18 01:34:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2021-12-18 01:34:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 01:34:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 01:34:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-12-18 01:34:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2021-12-18 01:34:15,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2021-12-18 01:34:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-12-18 01:34:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-12-18 01:34:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-12-18 01:34:15,879 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-12-18 01:34:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2021-12-18 01:34:15,879 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2021-12-18 01:34:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 01:34:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2021-12-18 01:34:15,880 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2021-12-18 01:34:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2021-12-18 01:34:15,880 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2021-12-18 01:34:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2021-12-18 01:34:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2021-12-18 01:34:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-12-18 01:34:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-12-18 01:34:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2021-12-18 01:34:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2021-12-18 01:34:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 01:34:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 01:34:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 01:34:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-12-18 01:34:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 01:34:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-12-18 01:34:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-12-18 01:34:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-18 01:34:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-18 01:34:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2021-12-18 01:34:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2021-12-18 01:34:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-18 01:34:15,884 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-18 01:34:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2021-12-18 01:34:15,884 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2021-12-18 01:34:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-18 01:34:15,884 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-18 01:34:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-12-18 01:34:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-12-18 01:34:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2021-12-18 01:34:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2021-12-18 01:34:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2021-12-18 01:34:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2021-12-18 01:34:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-12-18 01:34:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2021-12-18 01:34:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2021-12-18 01:34:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2021-12-18 01:34:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2021-12-18 01:34:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 01:34:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 01:34:16,335 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 01:34:16,337 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 01:34:18,753 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2021-12-18 01:34:20,991 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:34:29,191 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2021-12-18 01:34:29,191 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2021-12-18 01:34:29,291 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 01:34:29,301 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 01:34:29,301 INFO L301 CfgBuilder]: Removed 13 assume(true) statements. [2021-12-18 01:34:29,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:34:29 BoogieIcfgContainer [2021-12-18 01:34:29,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 01:34:29,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 01:34:29,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 01:34:29,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 01:34:29,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:34:13" (1/3) ... [2021-12-18 01:34:29,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6cb7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:34:29, skipping insertion in model container [2021-12-18 01:34:29,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:15" (2/3) ... [2021-12-18 01:34:29,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6cb7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:34:29, skipping insertion in model container [2021-12-18 01:34:29,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:34:29" (3/3) ... [2021-12-18 01:34:29,310 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-12-18 01:34:29,314 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 01:34:29,314 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 01:34:29,354 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 01:34:29,361 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 01:34:29,362 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 01:34:29,395 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) [2021-12-18 01:34:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 01:34:29,400 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:29,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:34:29,401 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:29,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1517292025, now seen corresponding path program 1 times [2021-12-18 01:34:29,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:29,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91801630] [2021-12-18 01:34:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:29,418 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:29,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:29,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:34:29,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 01:34:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:29,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 01:34:29,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:30,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:30,117 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:30,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91801630] [2021-12-18 01:34:30,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91801630] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:30,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:30,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 01:34:30,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248880468] [2021-12-18 01:34:30,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:30,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:34:30,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:30,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:34:30,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:34:30,192 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) [2021-12-18 01:34:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:30,392 INFO L93 Difference]: Finished difference Result 1253 states and 1768 transitions. [2021-12-18 01:34:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:34:30,394 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 [2021-12-18 01:34:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:30,411 INFO L225 Difference]: With dead ends: 1253 [2021-12-18 01:34:30,411 INFO L226 Difference]: Without dead ends: 824 [2021-12-18 01:34:30,417 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:30,420 INFO L933 BasicCegarLoop]: 695 mSDtfsCounter, 539 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2021-12-18 01:34:30,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [539 Valid, 1229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:34:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-12-18 01:34:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2021-12-18 01:34:30,520 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) [2021-12-18 01:34:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1076 transitions. [2021-12-18 01:34:30,528 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1076 transitions. Word has length 16 [2021-12-18 01:34:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:30,529 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1076 transitions. [2021-12-18 01:34:30,529 INFO L471 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) [2021-12-18 01:34:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1076 transitions. [2021-12-18 01:34:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 01:34:30,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:30,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:34:30,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-18 01:34:30,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:30,753 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:30,756 INFO L85 PathProgramCache]: Analyzing trace with hash 208359179, now seen corresponding path program 1 times [2021-12-18 01:34:30,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:30,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955182470] [2021-12-18 01:34:30,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:30,758 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:30,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:30,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:34:30,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 01:34:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:31,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 01:34:31,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:31,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:31,396 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:31,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955182470] [2021-12-18 01:34:31,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955182470] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:31,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:31,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 01:34:31,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221668941] [2021-12-18 01:34:31,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:31,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:34:31,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:31,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:34:31,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:34:31,399 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) [2021-12-18 01:34:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:31,516 INFO L93 Difference]: Finished difference Result 2433 states and 3207 transitions. [2021-12-18 01:34:31,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:34:31,517 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 [2021-12-18 01:34:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:31,533 INFO L225 Difference]: With dead ends: 2433 [2021-12-18 01:34:31,534 INFO L226 Difference]: Without dead ends: 1617 [2021-12-18 01:34:31,537 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:31,539 INFO L933 BasicCegarLoop]: 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.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:31,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 1161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:34:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2021-12-18 01:34:31,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1610. [2021-12-18 01:34:31,646 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) [2021-12-18 01:34:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2021-12-18 01:34:31,661 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 17 [2021-12-18 01:34:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:31,661 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2021-12-18 01:34:31,662 INFO L471 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) [2021-12-18 01:34:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2021-12-18 01:34:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-18 01:34:31,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:31,670 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:31,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:31,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:31,888 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash 26582145, now seen corresponding path program 1 times [2021-12-18 01:34:31,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:31,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633792363] [2021-12-18 01:34:31,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:31,890 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:31,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:31,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:34:31,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 01:34:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:32,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 01:34:32,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:34:32,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:32,957 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:32,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633792363] [2021-12-18 01:34:32,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633792363] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:32,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:32,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 01:34:32,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308888076] [2021-12-18 01:34:32,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:32,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:34:32,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:32,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:34:32,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:34:32,959 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) [2021-12-18 01:34:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:33,073 INFO L93 Difference]: Finished difference Result 3212 states and 4225 transitions. [2021-12-18 01:34:33,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:34:33,074 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 [2021-12-18 01:34:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:33,083 INFO L225 Difference]: With dead ends: 3212 [2021-12-18 01:34:33,083 INFO L226 Difference]: Without dead ends: 1610 [2021-12-18 01:34:33,088 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:33,089 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:33,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2179 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:34:33,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2021-12-18 01:34:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2021-12-18 01:34:33,146 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) [2021-12-18 01:34:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2116 transitions. [2021-12-18 01:34:33,156 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2116 transitions. Word has length 71 [2021-12-18 01:34:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:33,156 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 2116 transitions. [2021-12-18 01:34:33,156 INFO L471 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) [2021-12-18 01:34:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2116 transitions. [2021-12-18 01:34:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-18 01:34:33,159 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:33,159 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:33,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:33,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:33,376 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2146869344, now seen corresponding path program 1 times [2021-12-18 01:34:33,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:33,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548331092] [2021-12-18 01:34:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:33,378 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:33,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:34:33,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 01:34:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:33,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 01:34:33,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:34:34,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:34,290 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:34,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548331092] [2021-12-18 01:34:34,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548331092] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:34,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:34,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 01:34:34,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752212974] [2021-12-18 01:34:34,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:34,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:34:34,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:34,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:34:34,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:34:34,294 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) [2021-12-18 01:34:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:34,460 INFO L93 Difference]: Finished difference Result 3924 states and 5357 transitions. [2021-12-18 01:34:34,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:34:34,461 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 [2021-12-18 01:34:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:34,472 INFO L225 Difference]: With dead ends: 3924 [2021-12-18 01:34:34,473 INFO L226 Difference]: Without dead ends: 2325 [2021-12-18 01:34:34,478 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:34,480 INFO L933 BasicCegarLoop]: 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.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:34,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 1122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:34:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2021-12-18 01:34:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2313. [2021-12-18 01:34:34,579 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) [2021-12-18 01:34:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3224 transitions. [2021-12-18 01:34:34,594 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3224 transitions. Word has length 71 [2021-12-18 01:34:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:34,595 INFO L470 AbstractCegarLoop]: Abstraction has 2313 states and 3224 transitions. [2021-12-18 01:34:34,595 INFO L471 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) [2021-12-18 01:34:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3224 transitions. [2021-12-18 01:34:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-18 01:34:34,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:34,598 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:34,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:34,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:34,817 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:34,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:34,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569613, now seen corresponding path program 1 times [2021-12-18 01:34:34,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:34,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956396257] [2021-12-18 01:34:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:34,819 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:34,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:34,820 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:34:34,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 01:34:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:35,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 01:34:35,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:35,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:35,598 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:35,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956396257] [2021-12-18 01:34:35,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956396257] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:35,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:35,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 01:34:35,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272275368] [2021-12-18 01:34:35,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:35,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 01:34:35,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:35,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 01:34:35,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 01:34:35,600 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) [2021-12-18 01:34:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:36,053 INFO L93 Difference]: Finished difference Result 6261 states and 9014 transitions. [2021-12-18 01:34:36,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 01:34:36,054 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 [2021-12-18 01:34:36,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:36,073 INFO L225 Difference]: With dead ends: 6261 [2021-12-18 01:34:36,074 INFO L226 Difference]: Without dead ends: 3960 [2021-12-18 01:34:36,080 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:36,081 INFO L933 BasicCegarLoop]: 853 mSDtfsCounter, 447 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:36,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 2062 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 01:34:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2021-12-18 01:34:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 2329. [2021-12-18 01:34:36,189 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) [2021-12-18 01:34:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3240 transitions. [2021-12-18 01:34:36,201 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3240 transitions. Word has length 68 [2021-12-18 01:34:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:36,201 INFO L470 AbstractCegarLoop]: Abstraction has 2329 states and 3240 transitions. [2021-12-18 01:34:36,201 INFO L471 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) [2021-12-18 01:34:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3240 transitions. [2021-12-18 01:34:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-18 01:34:36,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:36,204 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:36,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:36,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:36,422 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:36,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1776712988, now seen corresponding path program 1 times [2021-12-18 01:34:36,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:36,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160562830] [2021-12-18 01:34:36,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:36,424 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:36,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:36,425 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:34:36,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 01:34:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:36,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 01:34:36,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:37,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:37,233 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:37,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160562830] [2021-12-18 01:34:37,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160562830] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:37,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:37,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 01:34:37,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742908188] [2021-12-18 01:34:37,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:37,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 01:34:37,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 01:34:37,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 01:34:37,236 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) [2021-12-18 01:34:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:37,641 INFO L93 Difference]: Finished difference Result 5821 states and 8310 transitions. [2021-12-18 01:34:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 01:34:37,642 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 [2021-12-18 01:34:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:37,660 INFO L225 Difference]: With dead ends: 5821 [2021-12-18 01:34:37,660 INFO L226 Difference]: Without dead ends: 3504 [2021-12-18 01:34:37,668 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:37,668 INFO L933 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:37,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 2023 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 01:34:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2021-12-18 01:34:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 2345. [2021-12-18 01:34:37,787 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) [2021-12-18 01:34:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3256 transitions. [2021-12-18 01:34:37,800 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3256 transitions. Word has length 69 [2021-12-18 01:34:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:37,800 INFO L470 AbstractCegarLoop]: Abstraction has 2345 states and 3256 transitions. [2021-12-18 01:34:37,800 INFO L471 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) [2021-12-18 01:34:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3256 transitions. [2021-12-18 01:34:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-18 01:34:37,803 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:37,803 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:37,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:38,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:38,025 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash 676145405, now seen corresponding path program 1 times [2021-12-18 01:34:38,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:38,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299352861] [2021-12-18 01:34:38,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:38,026 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:38,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:38,028 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:34:38,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 01:34:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:38,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 01:34:38,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:39,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:39,323 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:39,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299352861] [2021-12-18 01:34:39,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299352861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:39,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:39,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 01:34:39,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407588651] [2021-12-18 01:34:39,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:39,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:34:39,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:39,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:34:39,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:34:39,324 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) [2021-12-18 01:34:39,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:39,542 INFO L93 Difference]: Finished difference Result 3553 states and 4967 transitions. [2021-12-18 01:34:39,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:34:39,542 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 [2021-12-18 01:34:39,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:39,554 INFO L225 Difference]: With dead ends: 3553 [2021-12-18 01:34:39,554 INFO L226 Difference]: Without dead ends: 2377 [2021-12-18 01:34:39,559 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:39,560 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 2 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3260 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:39,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 3260 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:34:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2021-12-18 01:34:39,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2377. [2021-12-18 01:34:39,661 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) [2021-12-18 01:34:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3312 transitions. [2021-12-18 01:34:39,673 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3312 transitions. Word has length 69 [2021-12-18 01:34:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:39,674 INFO L470 AbstractCegarLoop]: Abstraction has 2377 states and 3312 transitions. [2021-12-18 01:34:39,674 INFO L471 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) [2021-12-18 01:34:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3312 transitions. [2021-12-18 01:34:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-18 01:34:39,678 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:39,678 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:39,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:39,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:39,892 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:39,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958436, now seen corresponding path program 1 times [2021-12-18 01:34:39,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:39,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085683851] [2021-12-18 01:34:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:39,894 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:39,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:39,896 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:34:39,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 01:34:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:40,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 01:34:40,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:41,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:41,142 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:41,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085683851] [2021-12-18 01:34:41,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085683851] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:41,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:41,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 01:34:41,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790325598] [2021-12-18 01:34:41,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:41,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 01:34:41,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:41,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 01:34:41,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 01:34:41,145 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) [2021-12-18 01:34:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:41,958 INFO L93 Difference]: Finished difference Result 5537 states and 7892 transitions. [2021-12-18 01:34:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 01:34:41,961 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 [2021-12-18 01:34:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:41,978 INFO L225 Difference]: With dead ends: 5537 [2021-12-18 01:34:41,978 INFO L226 Difference]: Without dead ends: 3172 [2021-12-18 01:34:41,988 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:41,988 INFO L933 BasicCegarLoop]: 911 mSDtfsCounter, 217 mSDsluCounter, 6980 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 7891 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:41,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 7891 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 01:34:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2021-12-18 01:34:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 2381. [2021-12-18 01:34:42,137 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) [2021-12-18 01:34:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3312 transitions. [2021-12-18 01:34:42,148 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3312 transitions. Word has length 69 [2021-12-18 01:34:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:42,149 INFO L470 AbstractCegarLoop]: Abstraction has 2381 states and 3312 transitions. [2021-12-18 01:34:42,149 INFO L471 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) [2021-12-18 01:34:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3312 transitions. [2021-12-18 01:34:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 01:34:42,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:42,154 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:42,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:42,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:42,368 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:42,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:42,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1395829828, now seen corresponding path program 1 times [2021-12-18 01:34:42,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:42,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407488618] [2021-12-18 01:34:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:42,369 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:42,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:42,371 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:34:42,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 01:34:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:42,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 01:34:42,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:43,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:43,437 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:43,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407488618] [2021-12-18 01:34:43,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407488618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:43,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:43,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 01:34:43,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617518330] [2021-12-18 01:34:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:43,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:34:43,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:43,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:34:43,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:34:43,438 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) [2021-12-18 01:34:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:43,701 INFO L93 Difference]: Finished difference Result 5691 states and 8110 transitions. [2021-12-18 01:34:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:34:43,704 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 [2021-12-18 01:34:43,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:43,725 INFO L225 Difference]: With dead ends: 5691 [2021-12-18 01:34:43,725 INFO L226 Difference]: Without dead ends: 3322 [2021-12-18 01:34:43,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:34:43,737 INFO L933 BasicCegarLoop]: 823 mSDtfsCounter, 168 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:43,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 3060 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:34:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2021-12-18 01:34:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 2171. [2021-12-18 01:34:43,893 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) [2021-12-18 01:34:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2982 transitions. [2021-12-18 01:34:43,904 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2982 transitions. Word has length 75 [2021-12-18 01:34:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:43,904 INFO L470 AbstractCegarLoop]: Abstraction has 2171 states and 2982 transitions. [2021-12-18 01:34:43,905 INFO L471 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) [2021-12-18 01:34:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2982 transitions. [2021-12-18 01:34:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 01:34:43,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:43,909 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:43,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:44,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:44,127 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:44,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash -506709307, now seen corresponding path program 1 times [2021-12-18 01:34:44,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:44,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122473107] [2021-12-18 01:34:44,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:44,128 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:44,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:44,130 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:34:44,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 01:34:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:44,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 01:34:44,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:45,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:45,603 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:45,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122473107] [2021-12-18 01:34:45,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122473107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:45,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:45,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 01:34:45,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045815382] [2021-12-18 01:34:45,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:45,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:34:45,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:45,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:34:45,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:34:45,605 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) [2021-12-18 01:34:48,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:34:50,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:34:54,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:34:57,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:34:59,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:01,946 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:03,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:08,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:13,526 INFO L93 Difference]: Finished difference Result 5559 states and 7703 transitions. [2021-12-18 01:35:13,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 01:35:13,527 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 [2021-12-18 01:35:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:13,573 INFO L225 Difference]: With dead ends: 5559 [2021-12-18 01:35:13,573 INFO L226 Difference]: Without dead ends: 4349 [2021-12-18 01:35:13,578 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:35:13,579 INFO L933 BasicCegarLoop]: 977 mSDtfsCounter, 1148 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 316 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:13,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1270 Valid, 2482 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1822 Invalid, 6 Unknown, 0 Unchecked, 27.5s Time] [2021-12-18 01:35:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4349 states. [2021-12-18 01:35:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4349 to 3357. [2021-12-18 01:35:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 2402 states have (on average 1.2743547044129893) internal successors, (3061), 2433 states have internal predecessors, (3061), 748 states have call successors, (748), 189 states have call predecessors, (748), 206 states have return successors, (840), 754 states have call predecessors, (840), 744 states have call successors, (840) [2021-12-18 01:35:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4649 transitions. [2021-12-18 01:35:13,749 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4649 transitions. Word has length 75 [2021-12-18 01:35:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:13,751 INFO L470 AbstractCegarLoop]: Abstraction has 3357 states and 4649 transitions. [2021-12-18 01:35:13,751 INFO L471 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) [2021-12-18 01:35:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4649 transitions. [2021-12-18 01:35:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-18 01:35:13,753 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:13,754 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:13,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:13,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:13,967 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash -9266808, now seen corresponding path program 1 times [2021-12-18 01:35:13,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:13,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276011878] [2021-12-18 01:35:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:13,969 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:13,970 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:35:13,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 01:35:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:14,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 01:35:14,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:35:15,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:35:15,135 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:15,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276011878] [2021-12-18 01:35:15,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276011878] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:35:15,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:35:15,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 01:35:15,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760576326] [2021-12-18 01:35:15,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:15,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:35:15,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:35:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:35:15,137 INFO L87 Difference]: Start difference. First operand 3357 states and 4649 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) [2021-12-18 01:35:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:15,279 INFO L93 Difference]: Finished difference Result 6708 states and 9388 transitions. [2021-12-18 01:35:15,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:35:15,280 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 [2021-12-18 01:35:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:15,293 INFO L225 Difference]: With dead ends: 6708 [2021-12-18 01:35:15,294 INFO L226 Difference]: Without dead ends: 3363 [2021-12-18 01:35:15,305 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:35:15,306 INFO L933 BasicCegarLoop]: 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 [2021-12-18 01:35:15,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1088 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:35:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2021-12-18 01:35:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3363. [2021-12-18 01:35:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3363 states, 2408 states have (on average 1.273671096345515) internal successors, (3067), 2439 states have internal predecessors, (3067), 748 states have call successors, (748), 189 states have call predecessors, (748), 206 states have return successors, (840), 754 states have call predecessors, (840), 744 states have call successors, (840) [2021-12-18 01:35:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4655 transitions. [2021-12-18 01:35:15,490 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4655 transitions. Word has length 94 [2021-12-18 01:35:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:15,491 INFO L470 AbstractCegarLoop]: Abstraction has 3363 states and 4655 transitions. [2021-12-18 01:35:15,491 INFO L471 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) [2021-12-18 01:35:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4655 transitions. [2021-12-18 01:35:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-18 01:35:15,493 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:15,494 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:15,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:15,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:15,707 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1858805077, now seen corresponding path program 1 times [2021-12-18 01:35:15,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:15,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725580209] [2021-12-18 01:35:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:15,709 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:15,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:15,711 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:35:15,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 01:35:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:16,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 01:35:16,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:35:16,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:35:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:35:17,336 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:17,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725580209] [2021-12-18 01:35:17,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725580209] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:35:17,336 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:35:17,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-18 01:35:17,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769624718] [2021-12-18 01:35:17,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:35:17,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:35:17,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:17,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:35:17,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:35:17,338 INFO L87 Difference]: Start difference. First operand 3363 states and 4655 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) [2021-12-18 01:35:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:17,693 INFO L93 Difference]: Finished difference Result 6732 states and 9424 transitions. [2021-12-18 01:35:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:35:17,695 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 [2021-12-18 01:35:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:17,706 INFO L225 Difference]: With dead ends: 6732 [2021-12-18 01:35:17,706 INFO L226 Difference]: Without dead ends: 3381 [2021-12-18 01:35:17,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:35:17,715 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 0 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:17,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2174 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:35:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2021-12-18 01:35:17,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3381. [2021-12-18 01:35:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 2426 states have (on average 1.2716405605935697) internal successors, (3085), 2457 states have internal predecessors, (3085), 748 states have call successors, (748), 189 states have call predecessors, (748), 206 states have return successors, (840), 754 states have call predecessors, (840), 744 states have call successors, (840) [2021-12-18 01:35:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4673 transitions. [2021-12-18 01:35:17,888 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4673 transitions. Word has length 95 [2021-12-18 01:35:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:17,888 INFO L470 AbstractCegarLoop]: Abstraction has 3381 states and 4673 transitions. [2021-12-18 01:35:17,889 INFO L471 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) [2021-12-18 01:35:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4673 transitions. [2021-12-18 01:35:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-18 01:35:17,891 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:17,891 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:17,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:18,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:18,110 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1398514888, now seen corresponding path program 2 times [2021-12-18 01:35:18,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:18,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662884104] [2021-12-18 01:35:18,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 01:35:18,112 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:18,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:18,113 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:35:18,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 01:35:18,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 01:35:18,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 01:35:18,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 01:35:18,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:18,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 01:35:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 01:35:19,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:35:19,170 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:19,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662884104] [2021-12-18 01:35:19,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662884104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:35:19,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:35:19,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 01:35:19,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824144028] [2021-12-18 01:35:19,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:19,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:35:19,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:19,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:35:19,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:35:19,172 INFO L87 Difference]: Start difference. First operand 3381 states and 4673 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2021-12-18 01:35:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:19,345 INFO L93 Difference]: Finished difference Result 6756 states and 9436 transitions. [2021-12-18 01:35:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:35:19,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 98 [2021-12-18 01:35:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:19,354 INFO L225 Difference]: With dead ends: 6756 [2021-12-18 01:35:19,355 INFO L226 Difference]: Without dead ends: 3387 [2021-12-18 01:35:19,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:35:19,363 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 0 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:19,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1086 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2021-12-18 01:35:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2021-12-18 01:35:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3387. [2021-12-18 01:35:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 2432 states have (on average 1.270970394736842) internal successors, (3091), 2463 states have internal predecessors, (3091), 748 states have call successors, (748), 189 states have call predecessors, (748), 206 states have return successors, (840), 754 states have call predecessors, (840), 744 states have call successors, (840) [2021-12-18 01:35:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4679 transitions. [2021-12-18 01:35:19,511 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4679 transitions. Word has length 98 [2021-12-18 01:35:19,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:19,511 INFO L470 AbstractCegarLoop]: Abstraction has 3387 states and 4679 transitions. [2021-12-18 01:35:19,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2021-12-18 01:35:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4679 transitions. [2021-12-18 01:35:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-18 01:35:19,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:19,514 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:19,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:19,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:19,733 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1871827029, now seen corresponding path program 1 times [2021-12-18 01:35:19,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:19,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214371113] [2021-12-18 01:35:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:19,735 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:19,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:19,736 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:35:19,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 01:35:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:20,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 01:35:20,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:35:20,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:35:20,696 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:20,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214371113] [2021-12-18 01:35:20,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214371113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:35:20,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:35:20,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 01:35:20,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307072135] [2021-12-18 01:35:20,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:20,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:35:20,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:20,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:35:20,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:35:20,697 INFO L87 Difference]: Start difference. First operand 3387 states and 4679 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) [2021-12-18 01:35:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:21,011 INFO L93 Difference]: Finished difference Result 8311 states and 11835 transitions. [2021-12-18 01:35:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:35:21,012 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 [2021-12-18 01:35:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:21,026 INFO L225 Difference]: With dead ends: 8311 [2021-12-18 01:35:21,026 INFO L226 Difference]: Without dead ends: 4936 [2021-12-18 01:35:21,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:35:21,035 INFO L933 BasicCegarLoop]: 824 mSDtfsCounter, 168 mSDsluCounter, 2242 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:21,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 3066 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:35:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4936 states. [2021-12-18 01:35:21,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4936 to 3205. [2021-12-18 01:35:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 2305 states have (on average 1.2650759219088936) internal successors, (2916), 2325 states have internal predecessors, (2916), 692 states have call successors, (692), 187 states have call predecessors, (692), 207 states have return successors, (792), 708 states have call predecessors, (792), 688 states have call successors, (792) [2021-12-18 01:35:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 4400 transitions. [2021-12-18 01:35:21,230 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 4400 transitions. Word has length 87 [2021-12-18 01:35:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:21,231 INFO L470 AbstractCegarLoop]: Abstraction has 3205 states and 4400 transitions. [2021-12-18 01:35:21,231 INFO L471 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) [2021-12-18 01:35:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 4400 transitions. [2021-12-18 01:35:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-18 01:35:21,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:21,234 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:21,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:21,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:21,448 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash -205382314, now seen corresponding path program 1 times [2021-12-18 01:35:21,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:21,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982850315] [2021-12-18 01:35:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:21,449 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:21,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:21,451 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:35:21,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 01:35:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:22,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 01:35:22,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:35:22,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:35:22,670 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:22,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982850315] [2021-12-18 01:35:22,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982850315] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:35:22,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:35:22,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 01:35:22,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60544311] [2021-12-18 01:35:22,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:22,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:35:22,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:22,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:35:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:35:22,672 INFO L87 Difference]: Start difference. First operand 3205 states and 4400 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) [2021-12-18 01:35:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:22,926 INFO L93 Difference]: Finished difference Result 4937 states and 6811 transitions. [2021-12-18 01:35:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:35:22,927 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 [2021-12-18 01:35:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:22,936 INFO L225 Difference]: With dead ends: 4937 [2021-12-18 01:35:22,936 INFO L226 Difference]: Without dead ends: 3217 [2021-12-18 01:35:22,944 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:35:22,944 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 1 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:22,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 3268 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:35:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2021-12-18 01:35:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3217. [2021-12-18 01:35:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 2317 states have (on average 1.263703064307294) internal successors, (2928), 2331 states have internal predecessors, (2928), 692 states have call successors, (692), 187 states have call predecessors, (692), 207 states have return successors, (792), 714 states have call predecessors, (792), 688 states have call successors, (792) [2021-12-18 01:35:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4412 transitions. [2021-12-18 01:35:23,118 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4412 transitions. Word has length 87 [2021-12-18 01:35:23,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:23,119 INFO L470 AbstractCegarLoop]: Abstraction has 3217 states and 4412 transitions. [2021-12-18 01:35:23,119 INFO L471 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) [2021-12-18 01:35:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4412 transitions. [2021-12-18 01:35:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-18 01:35:23,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:23,123 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:23,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:23,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:23,344 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:23,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2079481141, now seen corresponding path program 1 times [2021-12-18 01:35:23,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:23,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761583683] [2021-12-18 01:35:23,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:23,345 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:23,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:23,346 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:35:23,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-18 01:35:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:23,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 01:35:23,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:35:24,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:35:24,105 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:24,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761583683] [2021-12-18 01:35:24,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761583683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:35:24,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:35:24,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 01:35:24,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285450777] [2021-12-18 01:35:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:24,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:35:24,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:24,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:35:24,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:35:24,106 INFO L87 Difference]: Start difference. First operand 3217 states and 4412 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) [2021-12-18 01:35:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:24,495 INFO L93 Difference]: Finished difference Result 5974 states and 8426 transitions. [2021-12-18 01:35:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:35:24,496 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 [2021-12-18 01:35:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:24,506 INFO L225 Difference]: With dead ends: 5974 [2021-12-18 01:35:24,507 INFO L226 Difference]: Without dead ends: 4248 [2021-12-18 01:35:24,510 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:35:24,511 INFO L933 BasicCegarLoop]: 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.3s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:24,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 1448 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 01:35:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4248 states. [2021-12-18 01:35:24,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4248 to 3225. [2021-12-18 01:35:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3225 states, 2325 states have (on average 1.262795698924731) internal successors, (2936), 2339 states have internal predecessors, (2936), 692 states have call successors, (692), 187 states have call predecessors, (692), 207 states have return successors, (792), 714 states have call predecessors, (792), 688 states have call successors, (792) [2021-12-18 01:35:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 4420 transitions. [2021-12-18 01:35:24,710 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 4420 transitions. Word has length 87 [2021-12-18 01:35:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:24,711 INFO L470 AbstractCegarLoop]: Abstraction has 3225 states and 4420 transitions. [2021-12-18 01:35:24,711 INFO L471 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) [2021-12-18 01:35:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 4420 transitions. [2021-12-18 01:35:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-18 01:35:24,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:24,714 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:24,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:24,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:24,927 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:24,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash 390816807, now seen corresponding path program 1 times [2021-12-18 01:35:24,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:24,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765013347] [2021-12-18 01:35:24,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:24,929 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:24,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:24,930 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:35:24,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 01:35:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:25,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 01:35:25,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:35:25,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:35:25,868 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:25,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765013347] [2021-12-18 01:35:25,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765013347] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:35:25,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:35:25,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 01:35:25,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913475097] [2021-12-18 01:35:25,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:25,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 01:35:25,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:25,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 01:35:25,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 01:35:25,871 INFO L87 Difference]: Start difference. First operand 3225 states and 4420 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) [2021-12-18 01:35:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:26,221 INFO L93 Difference]: Finished difference Result 6500 states and 8895 transitions. [2021-12-18 01:35:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:35:26,222 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 [2021-12-18 01:35:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:26,231 INFO L225 Difference]: With dead ends: 6500 [2021-12-18 01:35:26,231 INFO L226 Difference]: Without dead ends: 3281 [2021-12-18 01:35:26,236 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:35:26,237 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 16 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:26,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 1645 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 01:35:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2021-12-18 01:35:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3243. [2021-12-18 01:35:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3243 states, 2337 states have (on average 1.2610183996576807) internal successors, (2947), 2351 states have internal predecessors, (2947), 695 states have call successors, (695), 190 states have call predecessors, (695), 210 states have return successors, (795), 717 states have call predecessors, (795), 691 states have call successors, (795) [2021-12-18 01:35:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 4437 transitions. [2021-12-18 01:35:26,412 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 4437 transitions. Word has length 94 [2021-12-18 01:35:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:26,412 INFO L470 AbstractCegarLoop]: Abstraction has 3243 states and 4437 transitions. [2021-12-18 01:35:26,413 INFO L471 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) [2021-12-18 01:35:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 4437 transitions. [2021-12-18 01:35:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-18 01:35:26,415 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:26,415 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:26,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:26,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:26,634 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 157343119, now seen corresponding path program 1 times [2021-12-18 01:35:26,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:26,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674134533] [2021-12-18 01:35:26,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:26,636 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:26,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:26,637 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:35:26,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-18 01:35:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:27,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 01:35:27,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 01:35:27,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:35:27,857 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:27,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674134533] [2021-12-18 01:35:27,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674134533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:35:27,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:35:27,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 01:35:27,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211654267] [2021-12-18 01:35:27,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:27,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:35:27,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:27,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:35:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:35:27,860 INFO L87 Difference]: Start difference. First operand 3243 states and 4437 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 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) [2021-12-18 01:35:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:28,834 INFO L93 Difference]: Finished difference Result 7824 states and 10963 transitions. [2021-12-18 01:35:28,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:35:28,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 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 99 [2021-12-18 01:35:28,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:28,851 INFO L225 Difference]: With dead ends: 7824 [2021-12-18 01:35:28,851 INFO L226 Difference]: Without dead ends: 4593 [2021-12-18 01:35:28,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:35:28,858 INFO L933 BasicCegarLoop]: 761 mSDtfsCounter, 173 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:28,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 2858 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-18 01:35:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2021-12-18 01:35:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 3127. [2021-12-18 01:35:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 2274 states have (on average 1.2590149516270888) internal successors, (2863), 2273 states have internal predecessors, (2863), 653 states have call successors, (653), 180 states have call predecessors, (653), 199 states have return successors, (747), 689 states have call predecessors, (747), 649 states have call successors, (747) [2021-12-18 01:35:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 4263 transitions. [2021-12-18 01:35:29,071 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 4263 transitions. Word has length 99 [2021-12-18 01:35:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:29,072 INFO L470 AbstractCegarLoop]: Abstraction has 3127 states and 4263 transitions. [2021-12-18 01:35:29,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 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) [2021-12-18 01:35:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 4263 transitions. [2021-12-18 01:35:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-18 01:35:29,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:29,074 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:29,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:29,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:29,296 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1118734186, now seen corresponding path program 1 times [2021-12-18 01:35:29,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:29,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720503522] [2021-12-18 01:35:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:29,298 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:29,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:29,299 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:35:29,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-18 01:35:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:29,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 01:35:29,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:35:30,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:35:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:35:31,818 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:31,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720503522] [2021-12-18 01:35:31,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720503522] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 01:35:31,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:35:31,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-12-18 01:35:31,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872821562] [2021-12-18 01:35:31,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:31,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:35:31,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:31,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:35:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-18 01:35:31,820 INFO L87 Difference]: Start difference. First operand 3127 states and 4263 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) [2021-12-18 01:35:34,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:37,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:40,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:44,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:46,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:50,274 INFO L93 Difference]: Finished difference Result 6337 states and 8661 transitions. [2021-12-18 01:35:50,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:35:50,276 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 [2021-12-18 01:35:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:50,298 INFO L225 Difference]: With dead ends: 6337 [2021-12-18 01:35:50,298 INFO L226 Difference]: Without dead ends: 6334 [2021-12-18 01:35:50,301 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:35:50,301 INFO L933 BasicCegarLoop]: 1010 mSDtfsCounter, 1169 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 227 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:50,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1246 Valid, 2107 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1275 Invalid, 4 Unknown, 0 Unchecked, 18.0s Time] [2021-12-18 01:35:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6334 states. [2021-12-18 01:35:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6334 to 6229. [2021-12-18 01:35:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6229 states, 4524 states have (on average 1.2623784261715296) internal successors, (5711), 4513 states have internal predecessors, (5711), 1311 states have call successors, (1311), 354 states have call predecessors, (1311), 393 states have return successors, (1529), 1397 states have call predecessors, (1529), 1307 states have call successors, (1529) [2021-12-18 01:35:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6229 states to 6229 states and 8551 transitions. [2021-12-18 01:35:50,650 INFO L78 Accepts]: Start accepts. Automaton has 6229 states and 8551 transitions. Word has length 89 [2021-12-18 01:35:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:50,650 INFO L470 AbstractCegarLoop]: Abstraction has 6229 states and 8551 transitions. [2021-12-18 01:35:50,650 INFO L471 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) [2021-12-18 01:35:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 6229 states and 8551 transitions. [2021-12-18 01:35:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-18 01:35:50,652 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:50,653 INFO L514 BasicCegarLoop]: 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, 1] [2021-12-18 01:35:50,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:50,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:50,867 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:50,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:50,868 INFO L85 PathProgramCache]: Analyzing trace with hash 815152912, now seen corresponding path program 1 times [2021-12-18 01:35:50,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:50,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882475782] [2021-12-18 01:35:50,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:50,869 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:50,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:50,870 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:35:50,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-18 01:35:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:51,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 01:35:51,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 01:35:52,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:35:52,385 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:52,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882475782] [2021-12-18 01:35:52,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882475782] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:35:52,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:35:52,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 01:35:52,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835520292] [2021-12-18 01:35:52,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:52,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 01:35:52,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:52,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 01:35:52,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 01:35:52,386 INFO L87 Difference]: Start difference. First operand 6229 states and 8551 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 7 states have internal predecessors, (71), 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) [2021-12-18 01:35:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:54,178 INFO L93 Difference]: Finished difference Result 16228 states and 22985 transitions. [2021-12-18 01:35:54,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 01:35:54,178 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 7 states have internal predecessors, (71), 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 97 [2021-12-18 01:35:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:54,204 INFO L225 Difference]: With dead ends: 16228 [2021-12-18 01:35:54,204 INFO L226 Difference]: Without dead ends: 10011 [2021-12-18 01:35:54,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-18 01:35:54,217 INFO L933 BasicCegarLoop]: 795 mSDtfsCounter, 228 mSDsluCounter, 6113 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 6908 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:54,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 6908 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-18 01:35:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10011 states. [2021-12-18 01:35:54,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10011 to 6229. [2021-12-18 01:35:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6229 states, 4524 states have (on average 1.258841732979664) internal successors, (5695), 4513 states have internal predecessors, (5695), 1311 states have call successors, (1311), 354 states have call predecessors, (1311), 393 states have return successors, (1529), 1397 states have call predecessors, (1529), 1307 states have call successors, (1529) [2021-12-18 01:35:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6229 states to 6229 states and 8535 transitions. [2021-12-18 01:35:54,598 INFO L78 Accepts]: Start accepts. Automaton has 6229 states and 8535 transitions. Word has length 97 [2021-12-18 01:35:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:54,598 INFO L470 AbstractCegarLoop]: Abstraction has 6229 states and 8535 transitions. [2021-12-18 01:35:54,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 7 states have internal predecessors, (71), 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) [2021-12-18 01:35:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 6229 states and 8535 transitions. [2021-12-18 01:35:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-18 01:35:54,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:54,601 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:54,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-12-18 01:35:54,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:54,815 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:54,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1748979270, now seen corresponding path program 1 times [2021-12-18 01:35:54,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:54,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89841359] [2021-12-18 01:35:54,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:54,817 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:54,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:54,819 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:35:54,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-18 01:35:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:55,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 01:35:55,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:35:56,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:35:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:35:57,913 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:57,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89841359] [2021-12-18 01:35:57,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89841359] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:35:57,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:35:57,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-12-18 01:35:57,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169849484] [2021-12-18 01:35:57,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:35:57,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 01:35:57,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:57,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 01:35:57,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:35:57,915 INFO L87 Difference]: Start difference. First operand 6229 states and 8535 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) [2021-12-18 01:36:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:36:00,043 INFO L93 Difference]: Finished difference Result 15758 states and 22355 transitions. [2021-12-18 01:36:00,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 01:36:00,044 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 [2021-12-18 01:36:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:36:00,078 INFO L225 Difference]: With dead ends: 15758 [2021-12-18 01:36:00,078 INFO L226 Difference]: Without dead ends: 9541 [2021-12-18 01:36:00,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-12-18 01:36:00,096 INFO L933 BasicCegarLoop]: 821 mSDtfsCounter, 221 mSDsluCounter, 8689 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 9510 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-18 01:36:00,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 9510 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-18 01:36:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9541 states. [2021-12-18 01:36:00,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9541 to 6231. [2021-12-18 01:36:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6231 states, 4522 states have (on average 1.2589562140645731) internal successors, (5693), 4521 states have internal predecessors, (5693), 1311 states have call successors, (1311), 354 states have call predecessors, (1311), 397 states have return successors, (1539), 1383 states have call predecessors, (1539), 1307 states have call successors, (1539) [2021-12-18 01:36:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 8543 transitions. [2021-12-18 01:36:00,575 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 8543 transitions. Word has length 94 [2021-12-18 01:36:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:36:00,576 INFO L470 AbstractCegarLoop]: Abstraction has 6231 states and 8543 transitions. [2021-12-18 01:36:00,576 INFO L471 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) [2021-12-18 01:36:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 8543 transitions. [2021-12-18 01:36:00,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-18 01:36:00,579 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:36:00,579 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:36:00,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-18 01:36:00,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:36:00,799 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:36:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:36:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 832679025, now seen corresponding path program 1 times [2021-12-18 01:36:00,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:36:00,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091868075] [2021-12-18 01:36:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:36:00,801 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:36:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:36:00,803 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:36:00,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-18 01:36:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:36:01,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 01:36:01,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:36:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:36:02,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:36:02,308 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:36:02,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091868075] [2021-12-18 01:36:02,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091868075] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:36:02,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:36:02,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 01:36:02,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661636143] [2021-12-18 01:36:02,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:36:02,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 01:36:02,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:36:02,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 01:36:02,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 01:36:02,309 INFO L87 Difference]: Start difference. First operand 6231 states and 8543 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) [2021-12-18 01:36:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:36:03,328 INFO L93 Difference]: Finished difference Result 14916 states and 21045 transitions. [2021-12-18 01:36:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 01:36:03,329 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 [2021-12-18 01:36:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:36:03,347 INFO L225 Difference]: With dead ends: 14916 [2021-12-18 01:36:03,347 INFO L226 Difference]: Without dead ends: 8697 [2021-12-18 01:36:03,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-18 01:36:03,360 INFO L933 BasicCegarLoop]: 834 mSDtfsCounter, 213 mSDsluCounter, 6369 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 7203 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 01:36:03,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 7203 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 01:36:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8697 states. [2021-12-18 01:36:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8697 to 6223. [2021-12-18 01:36:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6223 states, 4514 states have (on average 1.2558706247230838) internal successors, (5669), 4517 states have internal predecessors, (5669), 1311 states have call successors, (1311), 354 states have call predecessors, (1311), 397 states have return successors, (1539), 1379 states have call predecessors, (1539), 1307 states have call successors, (1539) [2021-12-18 01:36:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 8519 transitions. [2021-12-18 01:36:03,715 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 8519 transitions. Word has length 97 [2021-12-18 01:36:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:36:03,716 INFO L470 AbstractCegarLoop]: Abstraction has 6223 states and 8519 transitions. [2021-12-18 01:36:03,716 INFO L471 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) [2021-12-18 01:36:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 8519 transitions. [2021-12-18 01:36:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-18 01:36:03,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:36:03,719 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:36:03,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-18 01:36:03,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:36:03,940 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:36:03,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:36:03,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1118058599, now seen corresponding path program 1 times [2021-12-18 01:36:03,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:36:03,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165901346] [2021-12-18 01:36:03,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:36:03,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:36:03,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:36:03,944 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:36:03,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-18 01:36:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:36:04,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 01:36:04,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:36:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 01:36:05,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:36:05,519 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:36:05,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165901346] [2021-12-18 01:36:05,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165901346] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:36:05,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:36:05,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 01:36:05,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136315437] [2021-12-18 01:36:05,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:36:05,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:36:05,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:36:05,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:36:05,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:36:05,521 INFO L87 Difference]: Start difference. First operand 6223 states and 8519 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) [2021-12-18 01:36:07,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:36:09,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:36:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:36:10,070 INFO L93 Difference]: Finished difference Result 12503 states and 17117 transitions. [2021-12-18 01:36:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:36:10,071 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 [2021-12-18 01:36:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:36:10,089 INFO L225 Difference]: With dead ends: 12503 [2021-12-18 01:36:10,089 INFO L226 Difference]: Without dead ends: 6289 [2021-12-18 01:36:10,103 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:36:10,104 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 17 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:36:10,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 2774 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-18 01:36:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6289 states. [2021-12-18 01:36:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6289 to 6232. [2021-12-18 01:36:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6232 states, 4523 states have (on average 1.2553614857395534) internal successors, (5678), 4523 states have internal predecessors, (5678), 1311 states have call successors, (1311), 354 states have call predecessors, (1311), 397 states have return successors, (1538), 1382 states have call predecessors, (1538), 1307 states have call successors, (1538) [2021-12-18 01:36:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6232 states to 6232 states and 8527 transitions. [2021-12-18 01:36:10,472 INFO L78 Accepts]: Start accepts. Automaton has 6232 states and 8527 transitions. Word has length 108 [2021-12-18 01:36:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:36:10,472 INFO L470 AbstractCegarLoop]: Abstraction has 6232 states and 8527 transitions. [2021-12-18 01:36:10,473 INFO L471 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) [2021-12-18 01:36:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 6232 states and 8527 transitions. [2021-12-18 01:36:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-18 01:36:10,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:36:10,475 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:36:10,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-18 01:36:10,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:36:10,680 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:36:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:36:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1967666458, now seen corresponding path program 1 times [2021-12-18 01:36:10,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:36:10,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999465357] [2021-12-18 01:36:10,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:36:10,681 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:36:10,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:36:10,682 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:36:10,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-18 01:36:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:36:11,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 01:36:11,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:36:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 01:36:11,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:36:11,778 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:36:11,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999465357] [2021-12-18 01:36:11,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999465357] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:36:11,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:36:11,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 01:36:11,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709963568] [2021-12-18 01:36:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:36:11,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:36:11,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:36:11,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:36:11,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:36:11,780 INFO L87 Difference]: Start difference. First operand 6232 states and 8527 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) [2021-12-18 01:36:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:36:12,105 INFO L93 Difference]: Finished difference Result 12488 states and 17090 transitions. [2021-12-18 01:36:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:36:12,106 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 [2021-12-18 01:36:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:36:12,122 INFO L225 Difference]: With dead ends: 12488 [2021-12-18 01:36:12,123 INFO L226 Difference]: Without dead ends: 6268 [2021-12-18 01:36:12,137 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:36:12,137 INFO L933 BasicCegarLoop]: 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 [2021-12-18 01:36:12,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 1085 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:36:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2021-12-18 01:36:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 6256. [2021-12-18 01:36:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6256 states, 4547 states have (on average 1.2540136353639761) internal successors, (5702), 4547 states have internal predecessors, (5702), 1311 states have call successors, (1311), 354 states have call predecessors, (1311), 397 states have return successors, (1538), 1382 states have call predecessors, (1538), 1307 states have call successors, (1538) [2021-12-18 01:36:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6256 states to 6256 states and 8551 transitions. [2021-12-18 01:36:12,525 INFO L78 Accepts]: Start accepts. Automaton has 6256 states and 8551 transitions. Word has length 108 [2021-12-18 01:36:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:36:12,526 INFO L470 AbstractCegarLoop]: Abstraction has 6256 states and 8551 transitions. [2021-12-18 01:36:12,526 INFO L471 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) [2021-12-18 01:36:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 6256 states and 8551 transitions. [2021-12-18 01:36:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-18 01:36:12,529 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:36:12,529 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:36:12,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-18 01:36:12,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:36:12,740 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:36:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:36:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2053204873, now seen corresponding path program 1 times [2021-12-18 01:36:12,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:36:12,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12490577] [2021-12-18 01:36:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:36:12,741 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:36:12,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:36:12,746 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:36:12,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-18 01:36:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:36:13,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 01:36:13,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:36:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 01:36:14,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:36:14,670 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:36:14,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12490577] [2021-12-18 01:36:14,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12490577] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:36:14,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:36:14,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 01:36:14,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665746636] [2021-12-18 01:36:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:36:14,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 01:36:14,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:36:14,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 01:36:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-18 01:36:14,672 INFO L87 Difference]: Start difference. First operand 6256 states and 8551 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) [2021-12-18 01:36:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:36:16,917 INFO L93 Difference]: Finished difference Result 13506 states and 19027 transitions. [2021-12-18 01:36:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 01:36:16,918 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 [2021-12-18 01:36:16,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:36:16,938 INFO L225 Difference]: With dead ends: 13506 [2021-12-18 01:36:16,938 INFO L226 Difference]: Without dead ends: 8689 [2021-12-18 01:36:16,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-12-18 01:36:16,947 INFO L933 BasicCegarLoop]: 827 mSDtfsCounter, 209 mSDsluCounter, 7954 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 8781 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-18 01:36:16,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 8781 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-18 01:36:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8689 states. [2021-12-18 01:36:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8689 to 6200. [2021-12-18 01:36:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6200 states, 4517 states have (on average 1.2539295992915651) internal successors, (5664), 4527 states have internal predecessors, (5664), 1287 states have call successors, (1287), 350 states have call predecessors, (1287), 395 states have return successors, (1502), 1350 states have call predecessors, (1502), 1283 states have call successors, (1502) [2021-12-18 01:36:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 8453 transitions. [2021-12-18 01:36:17,295 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 8453 transitions. Word has length 104 [2021-12-18 01:36:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:36:17,296 INFO L470 AbstractCegarLoop]: Abstraction has 6200 states and 8453 transitions. [2021-12-18 01:36:17,296 INFO L471 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) [2021-12-18 01:36:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 8453 transitions. [2021-12-18 01:36:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-18 01:36:17,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:36:17,299 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:36:17,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-18 01:36:17,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:36:17,503 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:36:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:36:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1396982830, now seen corresponding path program 1 times [2021-12-18 01:36:17,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:36:17,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435998114] [2021-12-18 01:36:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:36:17,505 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:36:17,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:36:17,506 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:36:17,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-18 01:36:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:36:18,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 01:36:18,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:36:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 01:36:18,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:36:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 01:36:18,988 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:36:18,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435998114] [2021-12-18 01:36:18,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435998114] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:36:18,989 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:36:18,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-18 01:36:18,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265346580] [2021-12-18 01:36:18,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:36:18,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:36:18,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:36:18,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:36:18,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:36:18,990 INFO L87 Difference]: Start difference. First operand 6200 states and 8453 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) [2021-12-18 01:36:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:36:19,495 INFO L93 Difference]: Finished difference Result 12496 states and 17038 transitions. [2021-12-18 01:36:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:36:19,496 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 [2021-12-18 01:36:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:36:19,514 INFO L225 Difference]: With dead ends: 12496 [2021-12-18 01:36:19,514 INFO L226 Difference]: Without dead ends: 6308 [2021-12-18 01:36:19,527 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:36:19,528 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 4 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:36:19,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2169 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 01:36:19,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6308 states. [2021-12-18 01:36:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6308 to 6308. [2021-12-18 01:36:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6308 states, 4625 states have (on average 1.248) internal successors, (5772), 4635 states have internal predecessors, (5772), 1287 states have call successors, (1287), 350 states have call predecessors, (1287), 395 states have return successors, (1502), 1350 states have call predecessors, (1502), 1283 states have call successors, (1502) [2021-12-18 01:36:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6308 states to 6308 states and 8561 transitions. [2021-12-18 01:36:19,862 INFO L78 Accepts]: Start accepts. Automaton has 6308 states and 8561 transitions. Word has length 111 [2021-12-18 01:36:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:36:19,862 INFO L470 AbstractCegarLoop]: Abstraction has 6308 states and 8561 transitions. [2021-12-18 01:36:19,862 INFO L471 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) [2021-12-18 01:36:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6308 states and 8561 transitions. [2021-12-18 01:36:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-18 01:36:19,864 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:36:19,865 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:36:19,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-18 01:36:20,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:36:20,079 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:36:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:36:20,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1117139730, now seen corresponding path program 1 times [2021-12-18 01:36:20,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:36:20,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772487451] [2021-12-18 01:36:20,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:36:20,081 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:36:20,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:36:20,082 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:36:20,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-18 01:36:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 01:36:27,247 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 01:36:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 01:36:29,094 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-18 01:36:29,094 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 01:36:29,095 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 01:36:29,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-12-18 01:36:29,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:36:29,308 INFO L732 BasicCegarLoop]: Path program histogram: [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] [2021-12-18 01:36:29,310 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 01:36:29,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:36:29 BoogieIcfgContainer [2021-12-18 01:36:29,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 01:36:29,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 01:36:29,434 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 01:36:29,434 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 01:36:29,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:34:29" (3/4) ... [2021-12-18 01:36:29,437 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 01:36:29,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 01:36:29,438 INFO L158 Benchmark]: Toolchain (without parser) took 135903.11ms. Allocated memory was 58.7MB in the beginning and 790.6MB in the end (delta: 731.9MB). Free memory was 29.6MB in the beginning and 221.0MB in the end (delta: -191.4MB). Peak memory consumption was 542.1MB. Max. memory is 16.1GB. [2021-12-18 01:36:29,438 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 01:36:29,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1961.81ms. Allocated memory was 58.7MB in the beginning and 255.9MB in the end (delta: 197.1MB). Free memory was 29.3MB in the beginning and 209.0MB in the end (delta: -179.6MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2021-12-18 01:36:29,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 161.67ms. Allocated memory is still 255.9MB. Free memory was 209.0MB in the beginning and 199.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 01:36:29,438 INFO L158 Benchmark]: Boogie Preprocessor took 124.39ms. Allocated memory is still 255.9MB. Free memory was 199.5MB in the beginning and 189.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 01:36:29,439 INFO L158 Benchmark]: RCFGBuilder took 13517.56ms. Allocated memory is still 255.9MB. Free memory was 189.0MB in the beginning and 108.9MB in the end (delta: 80.2MB). Peak memory consumption was 138.9MB. Max. memory is 16.1GB. [2021-12-18 01:36:29,439 INFO L158 Benchmark]: TraceAbstraction took 120128.60ms. Allocated memory was 255.9MB in the beginning and 790.6MB in the end (delta: 534.8MB). Free memory was 108.9MB in the beginning and 222.0MB in the end (delta: -113.1MB). Peak memory consumption was 420.6MB. Max. memory is 16.1GB. [2021-12-18 01:36:29,439 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 790.6MB. Free memory was 222.0MB in the beginning and 221.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 01:36:29,441 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.19ms. Allocated memory is still 58.7MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1961.81ms. Allocated memory was 58.7MB in the beginning and 255.9MB in the end (delta: 197.1MB). Free memory was 29.3MB in the beginning and 209.0MB in the end (delta: -179.6MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 161.67ms. Allocated memory is still 255.9MB. Free memory was 209.0MB in the beginning and 199.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.39ms. Allocated memory is still 255.9MB. Free memory was 199.5MB in the beginning and 189.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 13517.56ms. Allocated memory is still 255.9MB. Free memory was 189.0MB in the beginning and 108.9MB in the end (delta: 80.2MB). Peak memory consumption was 138.9MB. Max. memory is 16.1GB. * TraceAbstraction took 120128.60ms. Allocated memory was 255.9MB in the beginning and 790.6MB in the end (delta: 534.8MB). Free memory was 108.9MB in the beginning and 222.0MB in the end (delta: -113.1MB). Peak memory consumption was 420.6MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 790.6MB. Free memory was 222.0MB in the beginning and 221.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 large string literal at line 5143. 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={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={-9223372036854775808:8}, 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={-9223372036854775808:8}, 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={-9223372036854775808:8}, 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={-9223372036854775808:8}, 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={-9223372036854775808:8}, 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={-9223372036854775808: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:-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)={63: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()={63: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={63: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={63: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={63:0}, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, arbitrary_memory={63: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={63:0}] [L6079] RET, EXPR usb_alloc_urb(0, 32U) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={-9223372036854775808: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:-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)={63: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={-9223372036854775808:8}, 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={63: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={63: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={63:104}, dma={63: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={63:104}, dma={63: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)={64: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={63:104}, dma={63: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()={64: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={64:0}, dev={0:0}, dev={0:0}, dma={63:104}, dma={63: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={64: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={64:0}, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, arbitrary_memory={64:0}, dev={0:0}, dev={0:0}, dma={63:104}, dma={63: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={64: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={-9223372036854775808:8}, 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={63:0}, usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma)={64: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={64:0}, cf={-9223372036854775808: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:-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={64:0}, urb={63: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={64:0}, cf={-9223372036854775808:8}, 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={64: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={64:0}, urb={63: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={64:0}, cf={-9223372036854775808:8}, 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={64: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={64:0}, urb={63: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={64:0}, cf={-9223372036854775808: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={64: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={64:0}, urb={63:0}] [L6109] msg->length = (u8 )5 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={64:0}, cf={-9223372036854775808: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={64: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={64:0}, urb={63: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={64:0}, cf={-9223372036854775808: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={64: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={64:0}, urb={63:0}] [L6135] COND TRUE 1 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={64:0}, cf={-9223372036854775808: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={64: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={64:0}, urb={63:0}] [L6137] COND TRUE i < 10 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={64:0}, cf={-9223372036854775808: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={64: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={64:0}, urb={63:0}] [L6141] EXPR dev->tx_contexts[i].echo_index VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={64:0}, cf={-9223372036854775808:8}, 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={64: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={64:0}, urb={63: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={64:0}, cf={-9223372036854775808: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={64: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={64:0}, urb={63:0}] [L6151] COND TRUE ! context VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={64:0}, cf={-9223372036854775808: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={64: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={64:0}, urb={63:0}] [L6153] FCALL usb_unanchor_urb(urb) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={64:0}, cf={-9223372036854775808: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={64: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={64:0}, urb={63:0}] [L6154] EXPR dev->udev [L6154] EXPR urb->transfer_dma VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={64:0}, cf={-9223372036854775808:8}, 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={64: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={64:0}, urb={63:0}, urb->transfer_dma=0] [L6154] CALL usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma) VAL [\old(dma)=0, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={64: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)=0, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={64:0}, addr={64:0}, dev={0:0}, dev={0:0}, dma=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, size=28] [L6804] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0))) VAL [\old(dma)=0, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={64:0}, addr={64:0}, dev={0:0}, dev={0:0}, dma=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, size=28] [L6810] COND TRUE \read(*addr) VAL [\old(dma)=0, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={64:0}, addr={64:0}, dev={0:0}, dev={0:0}, dma=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, size=28] [L6811] COND TRUE ldv_coherent_state >= 1 VAL [\old(dma)=0, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={64:0}, addr={64:0}, dev={0:0}, dev={0:0}, dma=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, size=28] [L6817] ldv_coherent_state = ldv_coherent_state - 1 VAL [\old(dma)=0, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, addr={64:0}, addr={64:0}, dev={0:0}, dev={0:0}, dma=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, 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={64:0}, cf={-9223372036854775808:8}, 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={64: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={64:0}, urb={63:0}, urb->transfer_dma=0] [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={64:0}, cf={-9223372036854775808: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={64: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={64:0}, urb={63: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: 120.0s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 65.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 7072 SdHoareTripleChecker+Valid, 57.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6209 mSDsluCounter, 83639 SdHoareTripleChecker+Invalid, 55.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4 IncrementalHoareTripleChecker+Unchecked, 65100 mSDsCounter, 833 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3951 IncrementalHoareTripleChecker+Invalid, 4800 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 833 mSolverCounterUnsat, 18539 mSDtfsCounter, 3951 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2532 GetRequests, 2408 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6308occurred in iteration=26, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 22234 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 14.7s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 2255 NumberOfCodeBlocks, 2233 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2508 ConstructedInterpolants, 1 QuantifiedInterpolants, 3688 SizeOfPredicates, 44 NumberOfNonLiveVariables, 21228 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 30 InterpolantComputations, 23 PerfectInterpolantSequences, 255/279 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 [2021-12-18 01:36:29,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample