./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 f4b24e32 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-?-f4b24e3 [2022-07-13 23:02:21,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 23:02:21,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 23:02:21,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 23:02:21,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 23:02:21,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 23:02:21,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 23:02:21,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 23:02:21,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 23:02:21,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 23:02:21,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 23:02:21,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 23:02:21,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 23:02:21,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 23:02:21,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 23:02:21,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 23:02:21,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 23:02:21,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 23:02:21,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 23:02:21,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 23:02:21,585 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 23:02:21,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 23:02:21,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 23:02:21,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 23:02:21,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 23:02:21,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 23:02:21,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 23:02:21,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 23:02:21,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 23:02:21,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 23:02:21,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 23:02:21,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 23:02:21,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 23:02:21,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 23:02:21,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 23:02:21,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 23:02:21,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 23:02:21,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 23:02:21,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 23:02:21,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 23:02:21,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 23:02:21,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 23:02:21,601 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 23:02:21,623 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 23:02:21,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 23:02:21,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 23:02:21,624 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 23:02:21,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 23:02:21,625 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 23:02:21,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 23:02:21,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 23:02:21,625 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 23:02:21,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 23:02:21,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 23:02:21,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 23:02:21,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 23:02:21,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 23:02:21,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 23:02:21,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 23:02:21,627 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 23:02:21,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 23:02:21,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 23:02:21,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 23:02:21,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 23:02:21,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:02:21,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 23:02:21,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 23:02:21,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 23:02:21,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 23:02:21,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 23:02:21,629 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 23:02:21,629 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 23:02:21,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 23:02:21,630 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 [2022-07-13 23:02:21,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 23:02:21,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 23:02:21,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 23:02:21,869 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 23:02:21,869 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 23:02:21,870 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 [2022-07-13 23:02:21,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0c73e28/2b3f7b14cf5d4efea8f326dc08840885/FLAG56c94a51c [2022-07-13 23:02:22,507 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 23:02:22,508 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 [2022-07-13 23:02:22,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0c73e28/2b3f7b14cf5d4efea8f326dc08840885/FLAG56c94a51c [2022-07-13 23:02:22,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0c73e28/2b3f7b14cf5d4efea8f326dc08840885 [2022-07-13 23:02:22,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 23:02:22,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 23:02:22,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 23:02:22,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 23:02:22,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 23:02:22,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:02:22" (1/1) ... [2022-07-13 23:02:22,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bfae72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:22, skipping insertion in model container [2022-07-13 23:02:22,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:02:22" (1/1) ... [2022-07-13 23:02:22,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 23:02:23,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:02:23,684 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] [2022-07-13 23:02:23,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:02:23,738 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 23:02:23,952 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] [2022-07-13 23:02:23,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:02:24,068 INFO L208 MainTranslator]: Completed translation [2022-07-13 23:02:24,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24 WrapperNode [2022-07-13 23:02:24,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 23:02:24,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 23:02:24,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 23:02:24,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 23:02:24,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24" (1/1) ... [2022-07-13 23:02:24,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24" (1/1) ... [2022-07-13 23:02:24,188 INFO L137 Inliner]: procedures = 133, calls = 733, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1375 [2022-07-13 23:02:24,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 23:02:24,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 23:02:24,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 23:02:24,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 23:02:24,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24" (1/1) ... [2022-07-13 23:02:24,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24" (1/1) ... [2022-07-13 23:02:24,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24" (1/1) ... [2022-07-13 23:02:24,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24" (1/1) ... [2022-07-13 23:02:24,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24" (1/1) ... [2022-07-13 23:02:24,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24" (1/1) ... [2022-07-13 23:02:24,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24" (1/1) ... [2022-07-13 23:02:24,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 23:02:24,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 23:02:24,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 23:02:24,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 23:02:24,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24" (1/1) ... [2022-07-13 23:02:24,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:02:24,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:24,344 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) [2022-07-13 23:02:24,365 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 [2022-07-13 23:02:24,388 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-13 23:02:24,388 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-13 23:02:24,388 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2022-07-13 23:02:24,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2022-07-13 23:02:24,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 23:02:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-13 23:02:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-13 23:02:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 23:02:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 23:02:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 23:02:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-13 23:02:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-13 23:02:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2022-07-13 23:02:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2022-07-13 23:02:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-13 23:02:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-13 23:02:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 23:02:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 23:02:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2022-07-13 23:02:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2022-07-13 23:02:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2022-07-13 23:02:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2022-07-13 23:02:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-13 23:02:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-13 23:02:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2022-07-13 23:02:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2022-07-13 23:02:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 23:02:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-13 23:02:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-13 23:02:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-13 23:02:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-13 23:02:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-13 23:02:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-13 23:02:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-13 23:02:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-13 23:02:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2022-07-13 23:02:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2022-07-13 23:02:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 23:02:24,393 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2022-07-13 23:02:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2022-07-13 23:02:24,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 23:02:24,393 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-13 23:02:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-13 23:02:24,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 23:02:24,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 23:02:24,393 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2022-07-13 23:02:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2022-07-13 23:02:24,394 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-13 23:02:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-13 23:02:24,394 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-13 23:02:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-13 23:02:24,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 23:02:24,394 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-07-13 23:02:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-07-13 23:02:24,395 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-13 23:02:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-13 23:02:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2022-07-13 23:02:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2022-07-13 23:02:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-13 23:02:24,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-13 23:02:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 23:02:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 23:02:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-13 23:02:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-13 23:02:24,398 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2022-07-13 23:02:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2022-07-13 23:02:24,398 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-13 23:02:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-13 23:02:24,398 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2022-07-13 23:02:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2022-07-13 23:02:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-13 23:02:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-13 23:02:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-13 23:02:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-13 23:02:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-13 23:02:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-13 23:02:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-07-13 23:02:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-07-13 23:02:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 23:02:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-07-13 23:02:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-07-13 23:02:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-13 23:02:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-13 23:02:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-13 23:02:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 23:02:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 23:02:24,755 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 23:02:24,757 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 23:02:25,031 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-13 23:02:25,191 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:02:26,582 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-07-13 23:02:26,583 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-07-13 23:02:26,598 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 23:02:26,607 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 23:02:26,607 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-07-13 23:02:26,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:02:26 BoogieIcfgContainer [2022-07-13 23:02:26,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 23:02:26,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 23:02:26,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 23:02:26,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 23:02:26,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:02:22" (1/3) ... [2022-07-13 23:02:26,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b87dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:02:26, skipping insertion in model container [2022-07-13 23:02:26,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:24" (2/3) ... [2022-07-13 23:02:26,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b87dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:02:26, skipping insertion in model container [2022-07-13 23:02:26,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:02:26" (3/3) ... [2022-07-13 23:02:26,619 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-07-13 23:02:26,629 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 23:02:26,629 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 23:02:26,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 23:02:26,698 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@189c9d1f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2db1920d [2022-07-13 23:02:26,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 23:02:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 431 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 316 states have internal predecessors, (411), 91 states have call successors, (91), 35 states have call predecessors, (91), 34 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2022-07-13 23:02:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 23:02:26,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:26,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:26,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:26,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1517292025, now seen corresponding path program 1 times [2022-07-13 23:02:26,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:26,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229408799] [2022-07-13 23:02:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:26,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:02:27,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:27,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229408799] [2022-07-13 23:02:27,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229408799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:27,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:27,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:02:27,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126337133] [2022-07-13 23:02:27,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:27,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:02:27,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:27,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:02:27,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:02:27,111 INFO L87 Difference]: Start difference. First operand has 431 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 316 states have internal predecessors, (411), 91 states have call successors, (91), 35 states have call predecessors, (91), 34 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:02:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:27,266 INFO L93 Difference]: Finished difference Result 1253 states and 1768 transitions. [2022-07-13 23:02:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:02:27,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-13 23:02:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:27,304 INFO L225 Difference]: With dead ends: 1253 [2022-07-13 23:02:27,305 INFO L226 Difference]: Without dead ends: 824 [2022-07-13 23:02:27,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:02:27,312 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 545 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:27,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:02:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-07-13 23:02:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2022-07-13 23:02:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 581 states have (on average 1.2581755593803787) internal successors, (731), 593 states have internal predecessors, (731), 173 states have call successors, (173), 66 states have call predecessors, (173), 65 states have return successors, (172), 165 states have call predecessors, (172), 169 states have call successors, (172) [2022-07-13 23:02:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1076 transitions. [2022-07-13 23:02:27,401 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1076 transitions. Word has length 16 [2022-07-13 23:02:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:27,402 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1076 transitions. [2022-07-13 23:02:27,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:02:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1076 transitions. [2022-07-13 23:02:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 23:02:27,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:27,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:27,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 23:02:27,403 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash 208359179, now seen corresponding path program 1 times [2022-07-13 23:02:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:27,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904943257] [2022-07-13 23:02:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:02:27,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:27,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904943257] [2022-07-13 23:02:27,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904943257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:27,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:27,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:02:27,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435297945] [2022-07-13 23:02:27,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:27,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:02:27,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:27,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:02:27,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:02:27,504 INFO L87 Difference]: Start difference. First operand 820 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:02:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:27,552 INFO L93 Difference]: Finished difference Result 2433 states and 3207 transitions. [2022-07-13 23:02:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:02:27,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-13 23:02:27,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:27,564 INFO L225 Difference]: With dead ends: 2433 [2022-07-13 23:02:27,564 INFO L226 Difference]: Without dead ends: 1617 [2022-07-13 23:02:27,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:02:27,570 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 535 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:27,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:02:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2022-07-13 23:02:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1610. [2022-07-13 23:02:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1141 states have (on average 1.2541630148992111) internal successors, (1431), 1160 states have internal predecessors, (1431), 340 states have call successors, (340), 129 states have call predecessors, (340), 128 states have return successors, (346), 328 states have call predecessors, (346), 336 states have call successors, (346) [2022-07-13 23:02:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2022-07-13 23:02:27,639 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 17 [2022-07-13 23:02:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:27,639 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2022-07-13 23:02:27,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:02:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2022-07-13 23:02:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 23:02:27,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:27,647 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:27,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 23:02:27,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 26582145, now seen corresponding path program 1 times [2022-07-13 23:02:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:27,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665266052] [2022-07-13 23:02:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:02:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:02:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:02:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 23:02:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 23:02:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 23:02:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:02:27,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:27,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665266052] [2022-07-13 23:02:27,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665266052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:27,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:27,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:02:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022486482] [2022-07-13 23:02:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:27,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:02:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:27,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:02:27,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:02:27,843 INFO L87 Difference]: Start difference. First operand 1610 states and 2117 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:02:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:29,797 INFO L93 Difference]: Finished difference Result 3324 states and 4411 transitions. [2022-07-13 23:02:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:02:29,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-07-13 23:02:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:29,804 INFO L225 Difference]: With dead ends: 3324 [2022-07-13 23:02:29,804 INFO L226 Difference]: Without dead ends: 1722 [2022-07-13 23:02:29,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:02:29,808 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 235 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:29,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1967 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-13 23:02:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-07-13 23:02:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1610. [2022-07-13 23:02:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1141 states have (on average 1.2532865907099036) internal successors, (1430), 1160 states have internal predecessors, (1430), 340 states have call successors, (340), 129 states have call predecessors, (340), 128 states have return successors, (346), 328 states have call predecessors, (346), 336 states have call successors, (346) [2022-07-13 23:02:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2116 transitions. [2022-07-13 23:02:29,848 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2116 transitions. Word has length 71 [2022-07-13 23:02:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:29,848 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2116 transitions. [2022-07-13 23:02:29,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:02:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2116 transitions. [2022-07-13 23:02:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 23:02:29,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:29,850 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:29,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 23:02:29,851 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:29,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2146869344, now seen corresponding path program 1 times [2022-07-13 23:02:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:29,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340149402] [2022-07-13 23:02:29,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:02:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:02:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:02:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 23:02:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 23:02:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 23:02:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:02:29,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:29,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340149402] [2022-07-13 23:02:29,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340149402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:29,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:29,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:02:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505575649] [2022-07-13 23:02:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:29,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:02:29,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:29,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:02:29,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:02:29,977 INFO L87 Difference]: Start difference. First operand 1610 states and 2116 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:02:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:31,751 INFO L93 Difference]: Finished difference Result 4036 states and 5567 transitions. [2022-07-13 23:02:31,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:02:31,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-07-13 23:02:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:31,783 INFO L225 Difference]: With dead ends: 4036 [2022-07-13 23:02:31,783 INFO L226 Difference]: Without dead ends: 2437 [2022-07-13 23:02:31,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:02:31,796 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 437 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:31,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1372 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-13 23:02:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-07-13 23:02:31,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2313. [2022-07-13 23:02:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 1640 states have (on average 1.2939024390243903) internal successors, (2122), 1675 states have internal predecessors, (2122), 544 states have call successors, (544), 129 states have call predecessors, (544), 128 states have return successors, (558), 524 states have call predecessors, (558), 540 states have call successors, (558) [2022-07-13 23:02:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3224 transitions. [2022-07-13 23:02:31,873 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3224 transitions. Word has length 71 [2022-07-13 23:02:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:31,873 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3224 transitions. [2022-07-13 23:02:31,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:02:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3224 transitions. [2022-07-13 23:02:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-13 23:02:31,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:31,876 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:31,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 23:02:31,876 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569613, now seen corresponding path program 1 times [2022-07-13 23:02:31,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:31,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138903863] [2022-07-13 23:02:31,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:31,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:31,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:02:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 23:02:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 23:02:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:02:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:32,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138903863] [2022-07-13 23:02:32,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138903863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:32,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:32,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:02:32,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632436848] [2022-07-13 23:02:32,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:32,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:02:32,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:32,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:02:32,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:02:32,055 INFO L87 Difference]: Start difference. First operand 2313 states and 3224 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:32,916 INFO L93 Difference]: Finished difference Result 6341 states and 9294 transitions. [2022-07-13 23:02:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:02:32,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2022-07-13 23:02:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:32,935 INFO L225 Difference]: With dead ends: 6341 [2022-07-13 23:02:32,935 INFO L226 Difference]: Without dead ends: 4040 [2022-07-13 23:02:32,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:02:32,944 INFO L413 NwaCegarLoop]: 868 mSDtfsCounter, 564 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:32,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 2629 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 23:02:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2022-07-13 23:02:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 2347. [2022-07-13 23:02:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1668 states have (on average 1.290167865707434) internal successors, (2152), 1705 states have internal predecessors, (2152), 544 states have call successors, (544), 129 states have call predecessors, (544), 134 states have return successors, (580), 528 states have call predecessors, (580), 540 states have call successors, (580) [2022-07-13 23:02:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3276 transitions. [2022-07-13 23:02:33,042 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3276 transitions. Word has length 68 [2022-07-13 23:02:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:33,043 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 3276 transitions. [2022-07-13 23:02:33,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3276 transitions. [2022-07-13 23:02:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 23:02:33,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:33,046 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:33,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 23:02:33,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:33,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:33,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1776712988, now seen corresponding path program 1 times [2022-07-13 23:02:33,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:33,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413522879] [2022-07-13 23:02:33,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:33,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:33,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:33,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:33,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:02:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:33,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:33,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:33,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:33,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:02:33,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:33,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413522879] [2022-07-13 23:02:33,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413522879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:33,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:33,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:02:33,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999678504] [2022-07-13 23:02:33,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:33,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:02:33,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:33,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:02:33,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:02:33,199 INFO L87 Difference]: Start difference. First operand 2347 states and 3276 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:34,086 INFO L93 Difference]: Finished difference Result 5919 states and 8590 transitions. [2022-07-13 23:02:34,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:02:34,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2022-07-13 23:02:34,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:34,102 INFO L225 Difference]: With dead ends: 5919 [2022-07-13 23:02:34,102 INFO L226 Difference]: Without dead ends: 3584 [2022-07-13 23:02:34,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:02:34,110 INFO L413 NwaCegarLoop]: 814 mSDtfsCounter, 453 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:34,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 2507 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:02:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2022-07-13 23:02:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 2363. [2022-07-13 23:02:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 1684 states have (on average 1.2874109263657958) internal successors, (2168), 1721 states have internal predecessors, (2168), 544 states have call successors, (544), 129 states have call predecessors, (544), 134 states have return successors, (580), 528 states have call predecessors, (580), 540 states have call successors, (580) [2022-07-13 23:02:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3292 transitions. [2022-07-13 23:02:34,248 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3292 transitions. Word has length 69 [2022-07-13 23:02:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:34,248 INFO L495 AbstractCegarLoop]: Abstraction has 2363 states and 3292 transitions. [2022-07-13 23:02:34,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3292 transitions. [2022-07-13 23:02:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 23:02:34,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:34,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:34,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 23:02:34,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:34,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash 676145405, now seen corresponding path program 1 times [2022-07-13 23:02:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:34,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130502227] [2022-07-13 23:02:34,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:02:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:02:34,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:34,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130502227] [2022-07-13 23:02:34,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130502227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:34,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:34,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 23:02:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598296810] [2022-07-13 23:02:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:34,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 23:02:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 23:02:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:02:34,464 INFO L87 Difference]: Start difference. First operand 2363 states and 3292 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:35,511 INFO L93 Difference]: Finished difference Result 3619 states and 5113 transitions. [2022-07-13 23:02:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:02:35,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2022-07-13 23:02:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:35,521 INFO L225 Difference]: With dead ends: 3619 [2022-07-13 23:02:35,521 INFO L226 Difference]: Without dead ends: 2425 [2022-07-13 23:02:35,525 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:02:35,525 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 117 mSDsluCounter, 2307 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 2844 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:35,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 2844 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 23:02:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2022-07-13 23:02:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2377. [2022-07-13 23:02:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 1694 states have (on average 1.2845336481700118) internal successors, (2176), 1731 states have internal predecessors, (2176), 544 states have call successors, (544), 129 states have call predecessors, (544), 138 states have return successors, (592), 532 states have call predecessors, (592), 540 states have call successors, (592) [2022-07-13 23:02:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3312 transitions. [2022-07-13 23:02:35,609 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3312 transitions. Word has length 69 [2022-07-13 23:02:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:35,610 INFO L495 AbstractCegarLoop]: Abstraction has 2377 states and 3312 transitions. [2022-07-13 23:02:35,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:35,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3312 transitions. [2022-07-13 23:02:35,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 23:02:35,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:35,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:35,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 23:02:35,613 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:35,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958436, now seen corresponding path program 1 times [2022-07-13 23:02:35,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:35,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968735199] [2022-07-13 23:02:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:35,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:02:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:02:35,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:35,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968735199] [2022-07-13 23:02:35,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968735199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:35,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:35,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 23:02:35,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672218162] [2022-07-13 23:02:35,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:35,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 23:02:35,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:35,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 23:02:35,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:02:35,787 INFO L87 Difference]: Start difference. First operand 2377 states and 3312 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:37,171 INFO L93 Difference]: Finished difference Result 5577 states and 8014 transitions. [2022-07-13 23:02:37,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 23:02:37,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2022-07-13 23:02:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:37,185 INFO L225 Difference]: With dead ends: 5577 [2022-07-13 23:02:37,186 INFO L226 Difference]: Without dead ends: 3212 [2022-07-13 23:02:37,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:02:37,192 INFO L413 NwaCegarLoop]: 908 mSDtfsCounter, 448 mSDsluCounter, 5493 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 6401 SdHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:37,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 6401 Invalid, 2517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 23:02:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2022-07-13 23:02:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 2381. [2022-07-13 23:02:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 1698 states have (on average 1.28150765606596) internal successors, (2176), 1733 states have internal predecessors, (2176), 544 states have call successors, (544), 129 states have call predecessors, (544), 138 states have return successors, (592), 534 states have call predecessors, (592), 540 states have call successors, (592) [2022-07-13 23:02:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3312 transitions. [2022-07-13 23:02:37,282 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3312 transitions. Word has length 69 [2022-07-13 23:02:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:37,282 INFO L495 AbstractCegarLoop]: Abstraction has 2381 states and 3312 transitions. [2022-07-13 23:02:37,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3312 transitions. [2022-07-13 23:02:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 23:02:37,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:37,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:37,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 23:02:37,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1804654053, now seen corresponding path program 1 times [2022-07-13 23:02:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:37,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111004495] [2022-07-13 23:02:37,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:02:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:02:37,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:37,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111004495] [2022-07-13 23:02:37,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111004495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:37,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:37,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 23:02:37,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438437177] [2022-07-13 23:02:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:37,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 23:02:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:37,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 23:02:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 23:02:37,471 INFO L87 Difference]: Start difference. First operand 2381 states and 3312 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:38,539 INFO L93 Difference]: Finished difference Result 5739 states and 8248 transitions. [2022-07-13 23:02:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:02:38,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 75 [2022-07-13 23:02:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:38,561 INFO L225 Difference]: With dead ends: 5739 [2022-07-13 23:02:38,561 INFO L226 Difference]: Without dead ends: 3370 [2022-07-13 23:02:38,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:02:38,571 INFO L413 NwaCegarLoop]: 815 mSDtfsCounter, 397 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:38,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 3672 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 23:02:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-07-13 23:02:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 2179. [2022-07-13 23:02:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1560 states have (on average 1.2717948717948717) internal successors, (1984), 1579 states have internal predecessors, (1984), 480 states have call successors, (480), 127 states have call predecessors, (480), 138 states have return successors, (532), 480 states have call predecessors, (532), 476 states have call successors, (532) [2022-07-13 23:02:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2996 transitions. [2022-07-13 23:02:38,676 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 2996 transitions. Word has length 75 [2022-07-13 23:02:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:38,677 INFO L495 AbstractCegarLoop]: Abstraction has 2179 states and 2996 transitions. [2022-07-13 23:02:38,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:02:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2996 transitions. [2022-07-13 23:02:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 23:02:38,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:38,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:38,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 23:02:38,682 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:38,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:38,683 INFO L85 PathProgramCache]: Analyzing trace with hash -506709307, now seen corresponding path program 1 times [2022-07-13 23:02:38,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:38,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379681894] [2022-07-13 23:02:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:38,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:38,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:38,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:38,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:02:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:38,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:38,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:38,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:38,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:38,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:02:38,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:38,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379681894] [2022-07-13 23:02:38,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379681894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:38,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:38,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 23:02:38,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114220322] [2022-07-13 23:02:38,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:38,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 23:02:38,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:38,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 23:02:38,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:02:38,906 INFO L87 Difference]: Start difference. First operand 2179 states and 2996 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-13 23:02:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:40,822 INFO L93 Difference]: Finished difference Result 3452 states and 4818 transitions. [2022-07-13 23:02:40,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 23:02:40,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 75 [2022-07-13 23:02:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:40,834 INFO L225 Difference]: With dead ends: 3452 [2022-07-13 23:02:40,834 INFO L226 Difference]: Without dead ends: 3447 [2022-07-13 23:02:40,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-07-13 23:02:40,836 INFO L413 NwaCegarLoop]: 919 mSDtfsCounter, 2408 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 1156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2521 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1156 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:40,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2521 Valid, 2310 Invalid, 2724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1156 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-13 23:02:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2022-07-13 23:02:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3363. [2022-07-13 23:02:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3363 states, 2405 states have (on average 1.2752598752598752) internal successors, (3067), 2440 states have internal predecessors, (3067), 748 states have call successors, (748), 189 states have call predecessors, (748), 209 states have return successors, (870), 749 states have call predecessors, (870), 744 states have call successors, (870) [2022-07-13 23:02:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4685 transitions. [2022-07-13 23:02:41,026 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4685 transitions. Word has length 75 [2022-07-13 23:02:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:41,027 INFO L495 AbstractCegarLoop]: Abstraction has 3363 states and 4685 transitions. [2022-07-13 23:02:41,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-13 23:02:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4685 transitions. [2022-07-13 23:02:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 23:02:41,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:41,031 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:41,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 23:02:41,031 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:41,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash -9266808, now seen corresponding path program 1 times [2022-07-13 23:02:41,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:41,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041086386] [2022-07-13 23:02:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:02:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 23:02:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:02:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:02:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:02:41,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:41,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041086386] [2022-07-13 23:02:41,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041086386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:41,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:41,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 23:02:41,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203256090] [2022-07-13 23:02:41,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:41,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 23:02:41,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:41,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 23:02:41,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:02:41,218 INFO L87 Difference]: Start difference. First operand 3363 states and 4685 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 23:02:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:42,318 INFO L93 Difference]: Finished difference Result 7643 states and 10959 transitions. [2022-07-13 23:02:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 23:02:42,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2022-07-13 23:02:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:42,330 INFO L225 Difference]: With dead ends: 7643 [2022-07-13 23:02:42,330 INFO L226 Difference]: Without dead ends: 4292 [2022-07-13 23:02:42,337 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:02:42,337 INFO L413 NwaCegarLoop]: 799 mSDtfsCounter, 599 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:42,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 2774 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 23:02:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2022-07-13 23:02:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 2826. [2022-07-13 23:02:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2031 states have (on average 1.2737567700640078) internal successors, (2587), 2057 states have internal predecessors, (2587), 624 states have call successors, (624), 153 states have call predecessors, (624), 170 states have return successors, (730), 631 states have call predecessors, (730), 620 states have call successors, (730) [2022-07-13 23:02:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3941 transitions. [2022-07-13 23:02:42,450 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3941 transitions. Word has length 94 [2022-07-13 23:02:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:42,451 INFO L495 AbstractCegarLoop]: Abstraction has 2826 states and 3941 transitions. [2022-07-13 23:02:42,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 23:02:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3941 transitions. [2022-07-13 23:02:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 23:02:42,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:42,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:42,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 23:02:42,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash 564700489, now seen corresponding path program 1 times [2022-07-13 23:02:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:42,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592824574] [2022-07-13 23:02:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:02:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 23:02:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:02:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:02:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 23:02:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 23:02:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:02:42,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:42,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592824574] [2022-07-13 23:02:42,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592824574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:42,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:42,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 23:02:42,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105392922] [2022-07-13 23:02:42,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:42,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 23:02:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:42,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 23:02:42,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:02:42,680 INFO L87 Difference]: Start difference. First operand 2826 states and 3941 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:02:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:44,417 INFO L93 Difference]: Finished difference Result 6776 states and 9771 transitions. [2022-07-13 23:02:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 23:02:44,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 92 [2022-07-13 23:02:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:44,429 INFO L225 Difference]: With dead ends: 6776 [2022-07-13 23:02:44,430 INFO L226 Difference]: Without dead ends: 4370 [2022-07-13 23:02:44,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:02:44,436 INFO L413 NwaCegarLoop]: 802 mSDtfsCounter, 433 mSDsluCounter, 5103 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 5905 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:44,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 5905 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 23:02:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2022-07-13 23:02:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 2826. [2022-07-13 23:02:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2031 states have (on average 1.2698178237321516) internal successors, (2579), 2057 states have internal predecessors, (2579), 624 states have call successors, (624), 153 states have call predecessors, (624), 170 states have return successors, (730), 631 states have call predecessors, (730), 620 states have call successors, (730) [2022-07-13 23:02:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3933 transitions. [2022-07-13 23:02:44,620 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3933 transitions. Word has length 92 [2022-07-13 23:02:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:44,621 INFO L495 AbstractCegarLoop]: Abstraction has 2826 states and 3933 transitions. [2022-07-13 23:02:44,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:02:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3933 transitions. [2022-07-13 23:02:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 23:02:44,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:44,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:44,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 23:02:44,623 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:44,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1871827029, now seen corresponding path program 1 times [2022-07-13 23:02:44,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:44,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753349559] [2022-07-13 23:02:44,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:44,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:02:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:02:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:02:44,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:44,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753349559] [2022-07-13 23:02:44,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753349559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:44,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:44,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 23:02:44,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565811748] [2022-07-13 23:02:44,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:44,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 23:02:44,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:44,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 23:02:44,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 23:02:44,759 INFO L87 Difference]: Start difference. First operand 2826 states and 3933 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 23:02:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:45,654 INFO L93 Difference]: Finished difference Result 6262 states and 9007 transitions. [2022-07-13 23:02:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 23:02:45,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2022-07-13 23:02:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:45,664 INFO L225 Difference]: With dead ends: 6262 [2022-07-13 23:02:45,664 INFO L226 Difference]: Without dead ends: 3856 [2022-07-13 23:02:45,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:02:45,669 INFO L413 NwaCegarLoop]: 809 mSDtfsCounter, 513 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 2805 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:45,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 2805 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 23:02:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2022-07-13 23:02:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 2636. [2022-07-13 23:02:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 1899 states have (on average 1.2622432859399684) internal successors, (2397), 1911 states have internal predecessors, (2397), 568 states have call successors, (568), 151 states have call predecessors, (568), 168 states have return successors, (670), 585 states have call predecessors, (670), 564 states have call successors, (670) [2022-07-13 23:02:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3635 transitions. [2022-07-13 23:02:45,820 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3635 transitions. Word has length 87 [2022-07-13 23:02:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:45,820 INFO L495 AbstractCegarLoop]: Abstraction has 2636 states and 3635 transitions. [2022-07-13 23:02:45,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 23:02:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3635 transitions. [2022-07-13 23:02:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 23:02:45,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:45,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:45,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 23:02:45,823 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash -205382314, now seen corresponding path program 1 times [2022-07-13 23:02:45,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:45,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367869866] [2022-07-13 23:02:45,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:02:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:02:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:02:46,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:46,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367869866] [2022-07-13 23:02:46,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367869866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:46,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:46,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 23:02:46,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841072018] [2022-07-13 23:02:46,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:46,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 23:02:46,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:46,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 23:02:46,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:02:46,026 INFO L87 Difference]: Start difference. First operand 2636 states and 3635 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 23:02:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:47,042 INFO L93 Difference]: Finished difference Result 3905 states and 5433 transitions. [2022-07-13 23:02:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 23:02:47,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 87 [2022-07-13 23:02:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:47,049 INFO L225 Difference]: With dead ends: 3905 [2022-07-13 23:02:47,049 INFO L226 Difference]: Without dead ends: 2681 [2022-07-13 23:02:47,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-13 23:02:47,052 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 340 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:47,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 2523 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 23:02:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2022-07-13 23:02:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2644. [2022-07-13 23:02:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 1907 states have (on average 1.261143156790771) internal successors, (2405), 1915 states have internal predecessors, (2405), 568 states have call successors, (568), 151 states have call predecessors, (568), 168 states have return successors, (670), 589 states have call predecessors, (670), 564 states have call successors, (670) [2022-07-13 23:02:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3643 transitions. [2022-07-13 23:02:47,158 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3643 transitions. Word has length 87 [2022-07-13 23:02:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:47,158 INFO L495 AbstractCegarLoop]: Abstraction has 2644 states and 3643 transitions. [2022-07-13 23:02:47,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 23:02:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3643 transitions. [2022-07-13 23:02:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 23:02:47,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:47,160 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:47,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 23:02:47,160 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2079481141, now seen corresponding path program 1 times [2022-07-13 23:02:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:47,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637220619] [2022-07-13 23:02:47,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:47,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:02:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:02:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:02:47,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:47,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637220619] [2022-07-13 23:02:47,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637220619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:47,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:47,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:02:47,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048352511] [2022-07-13 23:02:47,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:47,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:02:47,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:47,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:02:47,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:02:47,281 INFO L87 Difference]: Start difference. First operand 2644 states and 3643 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 23:02:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:48,042 INFO L93 Difference]: Finished difference Result 4660 states and 6627 transitions. [2022-07-13 23:02:48,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:02:48,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2022-07-13 23:02:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:48,051 INFO L225 Difference]: With dead ends: 4660 [2022-07-13 23:02:48,051 INFO L226 Difference]: Without dead ends: 3432 [2022-07-13 23:02:48,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:02:48,055 INFO L413 NwaCegarLoop]: 830 mSDtfsCounter, 426 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:48,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2101 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 23:02:48,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2022-07-13 23:02:48,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2652. [2022-07-13 23:02:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 1915 states have (on average 1.2600522193211487) internal successors, (2413), 1923 states have internal predecessors, (2413), 568 states have call successors, (568), 151 states have call predecessors, (568), 168 states have return successors, (670), 589 states have call predecessors, (670), 564 states have call successors, (670) [2022-07-13 23:02:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3651 transitions. [2022-07-13 23:02:48,185 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3651 transitions. Word has length 87 [2022-07-13 23:02:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:48,185 INFO L495 AbstractCegarLoop]: Abstraction has 2652 states and 3651 transitions. [2022-07-13 23:02:48,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 23:02:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3651 transitions. [2022-07-13 23:02:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 23:02:48,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:48,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:48,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 23:02:48,187 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:48,189 INFO L85 PathProgramCache]: Analyzing trace with hash 390816807, now seen corresponding path program 1 times [2022-07-13 23:02:48,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:48,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785076893] [2022-07-13 23:02:48,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:02:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:02:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 23:02:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:02:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:02:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 23:02:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 23:02:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 23:02:48,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:48,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785076893] [2022-07-13 23:02:48,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785076893] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:48,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:48,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:02:48,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967482578] [2022-07-13 23:02:48,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:48,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:02:48,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:48,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:02:48,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:02:48,276 INFO L87 Difference]: Start difference. First operand 2652 states and 3651 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 23:02:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:49,710 INFO L93 Difference]: Finished difference Result 5424 states and 7473 transitions. [2022-07-13 23:02:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:02:49,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2022-07-13 23:02:49,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:49,717 INFO L225 Difference]: With dead ends: 5424 [2022-07-13 23:02:49,717 INFO L226 Difference]: Without dead ends: 2778 [2022-07-13 23:02:49,723 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:02:49,724 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 247 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:49,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1643 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 23:02:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2022-07-13 23:02:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2664. [2022-07-13 23:02:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 1923 states have (on average 1.2584503380135206) internal successors, (2420), 1931 states have internal predecessors, (2420), 570 states have call successors, (570), 153 states have call predecessors, (570), 170 states have return successors, (672), 591 states have call predecessors, (672), 566 states have call successors, (672) [2022-07-13 23:02:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3662 transitions. [2022-07-13 23:02:49,819 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3662 transitions. Word has length 94 [2022-07-13 23:02:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:49,819 INFO L495 AbstractCegarLoop]: Abstraction has 2664 states and 3662 transitions. [2022-07-13 23:02:49,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 23:02:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3662 transitions. [2022-07-13 23:02:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 23:02:49,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:49,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:49,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 23:02:49,821 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1118734186, now seen corresponding path program 1 times [2022-07-13 23:02:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:49,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845529222] [2022-07-13 23:02:49,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:49,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:02:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:50,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:50,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:50,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 23:02:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:02:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:50,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845529222] [2022-07-13 23:02:50,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845529222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:50,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:50,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 23:02:50,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324989937] [2022-07-13 23:02:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:50,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 23:02:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:50,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 23:02:50,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:02:50,018 INFO L87 Difference]: Start difference. First operand 2664 states and 3662 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 6 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 23:02:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:52,073 INFO L93 Difference]: Finished difference Result 3982 states and 5507 transitions. [2022-07-13 23:02:52,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 23:02:52,073 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 6 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 89 [2022-07-13 23:02:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:52,083 INFO L225 Difference]: With dead ends: 3982 [2022-07-13 23:02:52,084 INFO L226 Difference]: Without dead ends: 3979 [2022-07-13 23:02:52,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-07-13 23:02:52,085 INFO L413 NwaCegarLoop]: 1007 mSDtfsCounter, 2068 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2199 SdHoareTripleChecker+Valid, 2907 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:52,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2199 Valid, 2907 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-13 23:02:52,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2022-07-13 23:02:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3879. [2022-07-13 23:02:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3879 states, 2797 states have (on average 1.2609939220593493) internal successors, (3527), 2814 states have internal predecessors, (3527), 838 states have call successors, (838), 215 states have call predecessors, (838), 243 states have return successors, (1014), 869 states have call predecessors, (1014), 834 states have call successors, (1014) [2022-07-13 23:02:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 5379 transitions. [2022-07-13 23:02:52,279 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 5379 transitions. Word has length 89 [2022-07-13 23:02:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:52,279 INFO L495 AbstractCegarLoop]: Abstraction has 3879 states and 5379 transitions. [2022-07-13 23:02:52,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 6 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 23:02:52,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 5379 transitions. [2022-07-13 23:02:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 23:02:52,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:52,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:52,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 23:02:52,282 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:52,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1748979270, now seen corresponding path program 1 times [2022-07-13 23:02:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:52,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344777322] [2022-07-13 23:02:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:52,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:02:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:02:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:02:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:02:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:02:52,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:52,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344777322] [2022-07-13 23:02:52,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344777322] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:52,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335753902] [2022-07-13 23:02:52,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:52,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:52,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:52,530 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) [2022-07-13 23:02:52,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 23:02:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 23:02:52,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:02:53,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:02:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:02:53,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335753902] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:02:53,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:02:53,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2022-07-13 23:02:53,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701440637] [2022-07-13 23:02:53,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:02:53,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 23:02:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 23:02:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2022-07-13 23:02:53,220 INFO L87 Difference]: Start difference. First operand 3879 states and 5379 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (19), 10 states have call predecessors, (19), 5 states have call successors, (19) [2022-07-13 23:02:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:57,963 INFO L93 Difference]: Finished difference Result 11133 states and 16255 transitions. [2022-07-13 23:02:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 23:02:57,964 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (19), 10 states have call predecessors, (19), 5 states have call successors, (19) Word has length 94 [2022-07-13 23:02:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:57,981 INFO L225 Difference]: With dead ends: 11133 [2022-07-13 23:02:57,981 INFO L226 Difference]: Without dead ends: 7266 [2022-07-13 23:02:57,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=1715, Unknown=0, NotChecked=0, Total=1892 [2022-07-13 23:02:57,990 INFO L413 NwaCegarLoop]: 931 mSDtfsCounter, 1009 mSDsluCounter, 12665 mSDsCounter, 0 mSdLazyCounter, 7785 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 13596 SdHoareTripleChecker+Invalid, 8355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 7785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:57,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 13596 Invalid, 8355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 7785 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-13 23:02:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7266 states. [2022-07-13 23:02:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7266 to 3833. [2022-07-13 23:02:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 2762 states have (on average 1.2617668356263576) internal successors, (3485), 2796 states have internal predecessors, (3485), 834 states have call successors, (834), 215 states have call predecessors, (834), 236 states have return successors, (952), 835 states have call predecessors, (952), 828 states have call successors, (952) [2022-07-13 23:02:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 5271 transitions. [2022-07-13 23:02:58,234 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 5271 transitions. Word has length 94 [2022-07-13 23:02:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:58,234 INFO L495 AbstractCegarLoop]: Abstraction has 3833 states and 5271 transitions. [2022-07-13 23:02:58,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (19), 10 states have call predecessors, (19), 5 states have call successors, (19) [2022-07-13 23:02:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 5271 transitions. [2022-07-13 23:02:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 23:02:58,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:58,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:58,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:58,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 23:02:58,456 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:58,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:58,457 INFO L85 PathProgramCache]: Analyzing trace with hash -448437055, now seen corresponding path program 1 times [2022-07-13 23:02:58,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:58,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870201481] [2022-07-13 23:02:58,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:58,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:02:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:02:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:02:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 23:02:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:02:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 23:02:58,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:58,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870201481] [2022-07-13 23:02:58,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870201481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:58,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:58,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 23:02:58,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459305139] [2022-07-13 23:02:58,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:58,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 23:02:58,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 23:02:58,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:02:58,734 INFO L87 Difference]: Start difference. First operand 3833 states and 5271 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 23:03:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:01,288 INFO L93 Difference]: Finished difference Result 10144 states and 13936 transitions. [2022-07-13 23:03:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 23:03:01,288 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 96 [2022-07-13 23:03:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:01,308 INFO L225 Difference]: With dead ends: 10144 [2022-07-13 23:03:01,309 INFO L226 Difference]: Without dead ends: 8384 [2022-07-13 23:03:01,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-07-13 23:03:01,315 INFO L413 NwaCegarLoop]: 909 mSDtfsCounter, 1940 mSDsluCounter, 2852 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 3761 SdHoareTripleChecker+Invalid, 3460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:01,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 3761 Invalid, 3460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 23:03:01,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8384 states. [2022-07-13 23:03:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8384 to 8132. [2022-07-13 23:03:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8132 states, 5885 states have (on average 1.2677994902293968) internal successors, (7461), 5936 states have internal predecessors, (7461), 1737 states have call successors, (1737), 461 states have call predecessors, (1737), 509 states have return successors, (1983), 1758 states have call predecessors, (1983), 1731 states have call successors, (1983) [2022-07-13 23:03:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 11181 transitions. [2022-07-13 23:03:01,768 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 11181 transitions. Word has length 96 [2022-07-13 23:03:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:01,769 INFO L495 AbstractCegarLoop]: Abstraction has 8132 states and 11181 transitions. [2022-07-13 23:03:01,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 23:03:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 11181 transitions. [2022-07-13 23:03:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 23:03:01,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:01,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:01,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 23:03:01,771 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:01,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash 832679025, now seen corresponding path program 1 times [2022-07-13 23:03:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:01,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743199995] [2022-07-13 23:03:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:03:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:03:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:03:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 23:03:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:03:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:03:01,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:01,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743199995] [2022-07-13 23:03:01,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743199995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:01,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:01,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 23:03:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434797688] [2022-07-13 23:03:01,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:01,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 23:03:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:01,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 23:03:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-13 23:03:01,977 INFO L87 Difference]: Start difference. First operand 8132 states and 11181 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:03:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:04,395 INFO L93 Difference]: Finished difference Result 17611 states and 24834 transitions. [2022-07-13 23:03:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 23:03:04,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2022-07-13 23:03:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:04,417 INFO L225 Difference]: With dead ends: 17611 [2022-07-13 23:03:04,417 INFO L226 Difference]: Without dead ends: 10847 [2022-07-13 23:03:04,429 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:03:04,430 INFO L413 NwaCegarLoop]: 811 mSDtfsCounter, 462 mSDsluCounter, 5629 mSDsCounter, 0 mSdLazyCounter, 3132 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 6440 SdHoareTripleChecker+Invalid, 3339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:04,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 6440 Invalid, 3339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3132 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-13 23:03:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10847 states. [2022-07-13 23:03:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10847 to 8126. [2022-07-13 23:03:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8126 states, 5879 states have (on average 1.2639904745705053) internal successors, (7431), 5933 states have internal predecessors, (7431), 1737 states have call successors, (1737), 461 states have call predecessors, (1737), 509 states have return successors, (1983), 1755 states have call predecessors, (1983), 1731 states have call successors, (1983) [2022-07-13 23:03:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 11151 transitions. [2022-07-13 23:03:05,173 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 11151 transitions. Word has length 97 [2022-07-13 23:03:05,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:05,173 INFO L495 AbstractCegarLoop]: Abstraction has 8126 states and 11151 transitions. [2022-07-13 23:03:05,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:03:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 11151 transitions. [2022-07-13 23:03:05,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 23:03:05,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:05,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:05,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 23:03:05,176 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:05,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1118058599, now seen corresponding path program 1 times [2022-07-13 23:03:05,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:05,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646108981] [2022-07-13 23:03:05,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:05,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:03:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:03:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:03:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 23:03:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 23:03:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 23:03:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:03:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 23:03:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 23:03:05,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:05,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646108981] [2022-07-13 23:03:05,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646108981] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:05,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489428365] [2022-07-13 23:03:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:05,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:05,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:05,436 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) [2022-07-13 23:03:05,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 23:03:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:03:05,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 23:03:05,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:05,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489428365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:05,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:05,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-13 23:03:05,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694389791] [2022-07-13 23:03:05,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:05,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:05,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:05,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:05,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:03:05,889 INFO L87 Difference]: Start difference. First operand 8126 states and 11151 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 23:03:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:06,230 INFO L93 Difference]: Finished difference Result 16288 states and 22354 transitions. [2022-07-13 23:03:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:06,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2022-07-13 23:03:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:06,246 INFO L225 Difference]: With dead ends: 16288 [2022-07-13 23:03:06,246 INFO L226 Difference]: Without dead ends: 8174 [2022-07-13 23:03:06,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:03:06,256 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 1 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:06,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1083 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:03:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8174 states. [2022-07-13 23:03:06,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8174 to 8158. [2022-07-13 23:03:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8158 states, 5911 states have (on average 1.2625613263407207) internal successors, (7463), 5965 states have internal predecessors, (7463), 1737 states have call successors, (1737), 461 states have call predecessors, (1737), 509 states have return successors, (1983), 1755 states have call predecessors, (1983), 1731 states have call successors, (1983) [2022-07-13 23:03:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 11183 transitions. [2022-07-13 23:03:06,597 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 11183 transitions. Word has length 108 [2022-07-13 23:03:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:06,597 INFO L495 AbstractCegarLoop]: Abstraction has 8158 states and 11183 transitions. [2022-07-13 23:03:06,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 23:03:06,597 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 11183 transitions. [2022-07-13 23:03:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 23:03:06,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:06,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:06,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:06,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-13 23:03:06,812 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash 920282283, now seen corresponding path program 1 times [2022-07-13 23:03:06,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:06,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270050633] [2022-07-13 23:03:06,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:06,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:03:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 23:03:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:03:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 23:03:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 23:03:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 23:03:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 23:03:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 23:03:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 23:03:07,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:07,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270050633] [2022-07-13 23:03:07,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270050633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:07,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:07,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 23:03:07,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402723842] [2022-07-13 23:03:07,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:07,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 23:03:07,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:07,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 23:03:07,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:03:07,101 INFO L87 Difference]: Start difference. First operand 8158 states and 11183 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 23:03:11,989 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:03:14,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:03:15,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:03:16,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:03:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:17,190 INFO L93 Difference]: Finished difference Result 18980 states and 26789 transitions. [2022-07-13 23:03:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:03:17,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2022-07-13 23:03:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:17,312 INFO L225 Difference]: With dead ends: 18980 [2022-07-13 23:03:17,312 INFO L226 Difference]: Without dead ends: 12202 [2022-07-13 23:03:17,337 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:03:17,338 INFO L413 NwaCegarLoop]: 793 mSDtfsCounter, 505 mSDsluCounter, 2901 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 321 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:17,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 3694 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1722 Invalid, 1 Unknown, 0 Unchecked, 9.4s Time] [2022-07-13 23:03:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12202 states. [2022-07-13 23:03:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12202 to 7987. [2022-07-13 23:03:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7987 states, 5818 states have (on average 1.2619456858026814) internal successors, (7342), 5860 states have internal predecessors, (7342), 1675 states have call successors, (1675), 445 states have call predecessors, (1675), 493 states have return successors, (1921), 1705 states have call predecessors, (1921), 1669 states have call successors, (1921) [2022-07-13 23:03:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7987 states to 7987 states and 10938 transitions. [2022-07-13 23:03:17,775 INFO L78 Accepts]: Start accepts. Automaton has 7987 states and 10938 transitions. Word has length 120 [2022-07-13 23:03:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:17,775 INFO L495 AbstractCegarLoop]: Abstraction has 7987 states and 10938 transitions. [2022-07-13 23:03:17,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 23:03:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 7987 states and 10938 transitions. [2022-07-13 23:03:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-13 23:03:17,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:17,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:17,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 23:03:17,780 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:17,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2053204873, now seen corresponding path program 1 times [2022-07-13 23:03:17,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:17,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625402235] [2022-07-13 23:03:17,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:17,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:17,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:03:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:03:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:17,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:17,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:17,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:17,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 23:03:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:17,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 23:03:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:03:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:03:18,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:18,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625402235] [2022-07-13 23:03:18,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625402235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:18,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:18,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-13 23:03:18,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087529226] [2022-07-13 23:03:18,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:18,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 23:03:18,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:18,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 23:03:18,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:03:18,006 INFO L87 Difference]: Start difference. First operand 7987 states and 10938 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 23:03:20,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:20,691 INFO L93 Difference]: Finished difference Result 15028 states and 21199 transitions. [2022-07-13 23:03:20,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 23:03:20,692 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 104 [2022-07-13 23:03:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:20,717 INFO L225 Difference]: With dead ends: 15028 [2022-07-13 23:03:20,717 INFO L226 Difference]: Without dead ends: 10127 [2022-07-13 23:03:20,730 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:03:20,730 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 559 mSDsluCounter, 5353 mSDsCounter, 0 mSdLazyCounter, 2899 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 6148 SdHoareTripleChecker+Invalid, 3211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 2899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:20,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 6148 Invalid, 3211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 2899 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 23:03:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10127 states. [2022-07-13 23:03:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10127 to 7133. [2022-07-13 23:03:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7133 states, 5203 states have (on average 1.2588891024408995) internal successors, (6550), 5251 states have internal predecessors, (6550), 1490 states have call successors, (1490), 403 states have call predecessors, (1490), 439 states have return successors, (1669), 1502 states have call predecessors, (1669), 1484 states have call successors, (1669) [2022-07-13 23:03:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 9709 transitions. [2022-07-13 23:03:21,172 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 9709 transitions. Word has length 104 [2022-07-13 23:03:21,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:21,172 INFO L495 AbstractCegarLoop]: Abstraction has 7133 states and 9709 transitions. [2022-07-13 23:03:21,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 23:03:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 9709 transitions. [2022-07-13 23:03:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-13 23:03:21,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:21,175 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:21,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 23:03:21,175 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:21,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:21,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1247847667, now seen corresponding path program 1 times [2022-07-13 23:03:21,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:21,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773166687] [2022-07-13 23:03:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:21,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:03:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:03:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:03:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 23:03:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:03:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 23:03:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 23:03:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:03:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 23:03:21,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:21,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773166687] [2022-07-13 23:03:21,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773166687] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:21,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6300336] [2022-07-13 23:03:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:21,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:21,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:21,314 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) [2022-07-13 23:03:21,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 23:03:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:03:21,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 23:03:21,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:03:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 23:03:21,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6300336] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:03:21,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:03:21,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2022-07-13 23:03:21,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339807923] [2022-07-13 23:03:21,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:03:21,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 23:03:21,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:21,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 23:03:21,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:03:21,887 INFO L87 Difference]: Start difference. First operand 7133 states and 9709 transitions. Second operand has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 9 states have internal predecessors, (111), 3 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-13 23:03:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:25,026 INFO L93 Difference]: Finished difference Result 14665 states and 19980 transitions. [2022-07-13 23:03:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 23:03:25,027 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 9 states have internal predecessors, (111), 3 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 111 [2022-07-13 23:03:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:25,047 INFO L225 Difference]: With dead ends: 14665 [2022-07-13 23:03:25,047 INFO L226 Difference]: Without dead ends: 7538 [2022-07-13 23:03:25,062 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:03:25,062 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 243 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 3209 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:25,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 3209 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 23:03:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2022-07-13 23:03:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 7268. [2022-07-13 23:03:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7268 states, 5338 states have (on average 1.252341701011615) internal successors, (6685), 5383 states have internal predecessors, (6685), 1490 states have call successors, (1490), 403 states have call predecessors, (1490), 439 states have return successors, (1667), 1505 states have call predecessors, (1667), 1484 states have call successors, (1667) [2022-07-13 23:03:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 9842 transitions. [2022-07-13 23:03:25,466 INFO L78 Accepts]: Start accepts. Automaton has 7268 states and 9842 transitions. Word has length 111 [2022-07-13 23:03:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:25,466 INFO L495 AbstractCegarLoop]: Abstraction has 7268 states and 9842 transitions. [2022-07-13 23:03:25,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 9 states have internal predecessors, (111), 3 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-13 23:03:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7268 states and 9842 transitions. [2022-07-13 23:03:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 23:03:25,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:25,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:25,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:25,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:25,689 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:25,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash 800394672, now seen corresponding path program 1 times [2022-07-13 23:03:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:25,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112349686] [2022-07-13 23:03:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:03:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 23:03:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:03:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 23:03:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 23:03:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 23:03:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:03:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:03:25,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:25,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112349686] [2022-07-13 23:03:25,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112349686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:25,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:25,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-13 23:03:25,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345928212] [2022-07-13 23:03:25,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:25,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 23:03:25,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:25,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 23:03:25,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:03:25,958 INFO L87 Difference]: Start difference. First operand 7268 states and 9842 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 23:03:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:29,263 INFO L93 Difference]: Finished difference Result 13334 states and 18523 transitions. [2022-07-13 23:03:29,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 23:03:29,264 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) Word has length 121 [2022-07-13 23:03:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:29,299 INFO L225 Difference]: With dead ends: 13334 [2022-07-13 23:03:29,300 INFO L226 Difference]: Without dead ends: 10002 [2022-07-13 23:03:29,312 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:03:29,313 INFO L413 NwaCegarLoop]: 766 mSDtfsCounter, 655 mSDsluCounter, 4865 mSDsCounter, 0 mSdLazyCounter, 3076 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 5631 SdHoareTripleChecker+Invalid, 3579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:29,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 5631 Invalid, 3579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3076 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-13 23:03:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10002 states. [2022-07-13 23:03:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10002 to 7266. [2022-07-13 23:03:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7266 states, 5338 states have (on average 1.2497189958786061) internal successors, (6671), 5381 states have internal predecessors, (6671), 1488 states have call successors, (1488), 403 states have call predecessors, (1488), 439 states have return successors, (1665), 1505 states have call predecessors, (1665), 1482 states have call successors, (1665) [2022-07-13 23:03:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7266 states to 7266 states and 9824 transitions. [2022-07-13 23:03:29,823 INFO L78 Accepts]: Start accepts. Automaton has 7266 states and 9824 transitions. Word has length 121 [2022-07-13 23:03:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:29,824 INFO L495 AbstractCegarLoop]: Abstraction has 7266 states and 9824 transitions. [2022-07-13 23:03:29,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 23:03:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 7266 states and 9824 transitions. [2022-07-13 23:03:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 23:03:29,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:29,827 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:29,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 23:03:29,827 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1117139730, now seen corresponding path program 1 times [2022-07-13 23:03:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:29,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112360609] [2022-07-13 23:03:29,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:29,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 23:03:29,969 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 23:03:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 23:03:30,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 23:03:30,288 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 23:03:30,289 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 23:03:30,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 23:03:30,293 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:30,296 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 23:03:30,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:03:30 BoogieIcfgContainer [2022-07-13 23:03:30,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 23:03:30,488 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 23:03:30,488 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 23:03:30,488 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 23:03:30,489 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:02:26" (3/4) ... [2022-07-13 23:03:30,491 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 23:03:30,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 23:03:30,491 INFO L158 Benchmark]: Toolchain (without parser) took 67546.22ms. Allocated memory was 92.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 46.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2022-07-13 23:03:30,492 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 23:03:30,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1122.09ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 46.1MB in the beginning and 66.7MB in the end (delta: -20.6MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2022-07-13 23:03:30,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.06ms. Allocated memory is still 115.3MB. Free memory was 66.7MB in the beginning and 56.9MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 23:03:30,493 INFO L158 Benchmark]: Boogie Preprocessor took 104.95ms. Allocated memory is still 115.3MB. Free memory was 56.9MB in the beginning and 47.1MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 23:03:30,493 INFO L158 Benchmark]: RCFGBuilder took 2317.08ms. Allocated memory was 115.3MB in the beginning and 169.9MB in the end (delta: 54.5MB). Free memory was 47.1MB in the beginning and 103.5MB in the end (delta: -56.4MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2022-07-13 23:03:30,495 INFO L158 Benchmark]: TraceAbstraction took 63874.20ms. Allocated memory was 169.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 102.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 799.1MB. Max. memory is 16.1GB. [2022-07-13 23:03:30,495 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 1.3GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 23:03:30,504 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.15ms. Allocated memory is still 92.3MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1122.09ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 46.1MB in the beginning and 66.7MB in the end (delta: -20.6MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.06ms. Allocated memory is still 115.3MB. Free memory was 66.7MB in the beginning and 56.9MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.95ms. Allocated memory is still 115.3MB. Free memory was 56.9MB in the beginning and 47.1MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2317.08ms. Allocated memory was 115.3MB in the beginning and 169.9MB in the end (delta: 54.5MB). Free memory was 47.1MB in the beginning and 103.5MB in the end (delta: -56.4MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * TraceAbstraction took 63874.20ms. Allocated memory was 169.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 102.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 799.1MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 1.3GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551622:0}, skb={18446744073709551622:0}] [L6066] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, cf={-18446744073709551617:19}, cf->can_dlc=2, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622:0}, tmp___7=0] [L5266] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, cf={-18446744073709551617:19}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551625:18446744073709551627}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, dev={18446744073709551625:18446744073709551627}, 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={18446744073709551620:18446744073709551623}, dev={18446744073709551625:18446744073709551627}, dev={18446744073709551625:18446744073709551627}, 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={18446744073709551620:18446744073709551623}, dev={18446744073709551625:18446744073709551627}, dev={18446744073709551625:18446744073709551627}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, dev={18446744073709551625:18446744073709551627}, dev={18446744073709551625:18446744073709551627}, 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={18446744073709551620:18446744073709551623}, arbitrary_memory={-18446744073709551617:0}, dev={18446744073709551625:18446744073709551627}, dev={18446744073709551625:18446744073709551627}, 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={18446744073709551620:18446744073709551623}, arbitrary_memory={-18446744073709551617:0}, dev={18446744073709551625:18446744073709551627}, dev={18446744073709551625:18446744073709551627}, 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={18446744073709551620:18446744073709551623}, cf={-18446744073709551617:19}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551625:18446744073709551627}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, cf->can_id=2, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, cf->can_id=2, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551625:18446744073709551627}, 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={18446744073709551622:0}, skb={18446744073709551622:0}, stats={0:-331}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}, urb->transfer_dma=18446744073709551626] [L6154] CALL usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma) VAL [\old(dma)=10, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, addr={-18446744073709551617:0}, dev={18446744073709551625:18446744073709551627}, 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)=10, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551625:18446744073709551627}, dev={18446744073709551625:18446744073709551627}, dma=10, 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)=10, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551625:18446744073709551627}, dev={18446744073709551625:18446744073709551627}, dma=10, 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)=10, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551625:18446744073709551627}, dev={18446744073709551625:18446744073709551627}, dma=10, 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)=10, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551625:18446744073709551627}, dev={18446744073709551625:18446744073709551627}, dma=10, 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)=10, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={18446744073709551625:18446744073709551627}, dev={18446744073709551625:18446744073709551627}, dma=10, 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={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, context={0:0}, dev={0:-520}, dev->udev={18446744073709551625:18446744073709551627}, 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={18446744073709551622:0}, skb={18446744073709551622:0}, stats={0:-331}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-3:0}, urb->transfer_dma=18446744073709551626] [L6155] netdev->dev.parent [L6157] return ((netdev_tx_t )16); VAL [\result=16, __key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, buf={-18446744073709551617:0}, cf={-18446744073709551617:19}, 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={18446744073709551622:0}, skb={18446744073709551622: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={18446744073709551620:18446744073709551623}, 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={18446744073709551622:0}] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND FALSE !(\read(tmp___9)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, 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={18446744073709551622: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={18446744073709551620:18446744073709551623}, 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={18446744073709551622:0}] [L6650] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, 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={18446744073709551622:0}] [L6742] CALL ems_usb_exit() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551622: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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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={18446744073709551620:18446744073709551623}, 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: 63.6s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 50.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 17404 SdHoareTripleChecker+Valid, 42.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16139 mSDsluCounter, 90312 SdHoareTripleChecker+Invalid, 37.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71608 mSDsCounter, 8246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40998 IncrementalHoareTripleChecker+Invalid, 49245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8246 mSolverCounterUnsat, 18704 mSDtfsCounter, 40998 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1287 GetRequests, 976 SyntacticMatches, 1 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2.4s 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.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 27213 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2500 NumberOfCodeBlocks, 2500 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2569 ConstructedInterpolants, 0 QuantifiedInterpolants, 5003 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 [2022-07-13 23:03:30,603 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 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-?-f4b24e3 [2022-07-13 23:03:32,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 23:03:32,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 23:03:32,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 23:03:32,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 23:03:32,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 23:03:32,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 23:03:32,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 23:03:32,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 23:03:32,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 23:03:32,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 23:03:32,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 23:03:32,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 23:03:32,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 23:03:32,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 23:03:32,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 23:03:32,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 23:03:32,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 23:03:32,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 23:03:32,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 23:03:32,595 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 23:03:32,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 23:03:32,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 23:03:32,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 23:03:32,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 23:03:32,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 23:03:32,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 23:03:32,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 23:03:32,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 23:03:32,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 23:03:32,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 23:03:32,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 23:03:32,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 23:03:32,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 23:03:32,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 23:03:32,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 23:03:32,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 23:03:32,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 23:03:32,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 23:03:32,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 23:03:32,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 23:03:32,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 23:03:32,616 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-13 23:03:32,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 23:03:32,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 23:03:32,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 23:03:32,641 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 23:03:32,642 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 23:03:32,642 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 23:03:32,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 23:03:32,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 23:03:32,643 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 23:03:32,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 23:03:32,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 23:03:32,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 23:03:32,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 23:03:32,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 23:03:32,644 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 23:03:32,645 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 23:03:32,645 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 23:03:32,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 23:03:32,645 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 23:03:32,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 23:03:32,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 23:03:32,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 23:03:32,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 23:03:32,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:03:32,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 23:03:32,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 23:03:32,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 23:03:32,646 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 23:03:32,646 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 23:03:32,646 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 23:03:32,647 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 23:03:32,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 23:03:32,647 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 23:03:32,647 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 [2022-07-13 23:03:33,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 23:03:33,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 23:03:33,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 23:03:33,118 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 23:03:33,119 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 23:03:33,120 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 [2022-07-13 23:03:33,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f28f6ba1/89073f93a0fd460fa4de08caa52b5b17/FLAG6105f0efd [2022-07-13 23:03:33,636 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 23:03:33,637 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 [2022-07-13 23:03:33,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f28f6ba1/89073f93a0fd460fa4de08caa52b5b17/FLAG6105f0efd [2022-07-13 23:03:33,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f28f6ba1/89073f93a0fd460fa4de08caa52b5b17 [2022-07-13 23:03:33,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 23:03:33,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 23:03:33,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 23:03:33,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 23:03:33,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 23:03:33,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:03:33" (1/1) ... [2022-07-13 23:03:33,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a94c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:33, skipping insertion in model container [2022-07-13 23:03:33,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:03:33" (1/1) ... [2022-07-13 23:03:33,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 23:03:34,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:03:34,819 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] [2022-07-13 23:03:34,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:03:34,884 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 23:03:34,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:03:35,105 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] [2022-07-13 23:03:35,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:03:35,124 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 23:03:35,347 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] [2022-07-13 23:03:35,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:03:35,506 INFO L208 MainTranslator]: Completed translation [2022-07-13 23:03:35,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35 WrapperNode [2022-07-13 23:03:35,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 23:03:35,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 23:03:35,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 23:03:35,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 23:03:35,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35" (1/1) ... [2022-07-13 23:03:35,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35" (1/1) ... [2022-07-13 23:03:35,631 INFO L137 Inliner]: procedures = 148, calls = 733, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1342 [2022-07-13 23:03:35,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 23:03:35,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 23:03:35,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 23:03:35,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 23:03:35,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35" (1/1) ... [2022-07-13 23:03:35,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35" (1/1) ... [2022-07-13 23:03:35,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35" (1/1) ... [2022-07-13 23:03:35,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35" (1/1) ... [2022-07-13 23:03:35,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35" (1/1) ... [2022-07-13 23:03:35,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35" (1/1) ... [2022-07-13 23:03:35,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35" (1/1) ... [2022-07-13 23:03:35,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 23:03:35,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 23:03:35,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 23:03:35,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 23:03:35,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35" (1/1) ... [2022-07-13 23:03:35,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:03:35,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:35,788 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) [2022-07-13 23:03:35,838 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 [2022-07-13 23:03:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-13 23:03:35,861 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-13 23:03:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 23:03:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2022-07-13 23:03:35,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2022-07-13 23:03:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-13 23:03:35,862 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-13 23:03:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-13 23:03:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 23:03:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 23:03:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 23:03:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-13 23:03:35,862 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-13 23:03:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2022-07-13 23:03:35,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2022-07-13 23:03:35,863 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-13 23:03:35,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-13 23:03:35,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 23:03:35,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 23:03:35,863 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2022-07-13 23:03:35,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2022-07-13 23:03:35,863 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2022-07-13 23:03:35,863 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2022-07-13 23:03:35,863 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-13 23:03:35,864 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-13 23:03:35,864 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2022-07-13 23:03:35,864 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2022-07-13 23:03:35,864 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-13 23:03:35,864 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-13 23:03:35,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-13 23:03:35,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-13 23:03:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-13 23:03:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-13 23:03:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-13 23:03:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-13 23:03:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-13 23:03:35,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-13 23:03:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-13 23:03:35,866 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-13 23:03:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2022-07-13 23:03:35,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2022-07-13 23:03:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 23:03:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2022-07-13 23:03:35,866 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2022-07-13 23:03:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 23:03:35,867 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-13 23:03:35,867 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-13 23:03:35,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 23:03:35,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 23:03:35,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-13 23:03:35,868 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2022-07-13 23:03:35,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2022-07-13 23:03:35,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-13 23:03:35,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-13 23:03:35,869 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-13 23:03:35,869 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-13 23:03:35,869 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-13 23:03:35,869 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-13 23:03:35,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 23:03:35,869 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-07-13 23:03:35,870 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-07-13 23:03:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-13 23:03:35,870 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-13 23:03:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2022-07-13 23:03:35,870 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2022-07-13 23:03:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-13 23:03:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-13 23:03:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-13 23:03:35,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-13 23:03:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 23:03:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 23:03:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 23:03:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-13 23:03:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 23:03:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-13 23:03:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-13 23:03:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-13 23:03:35,872 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-13 23:03:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2022-07-13 23:03:35,872 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2022-07-13 23:03:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-13 23:03:35,872 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-13 23:03:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2022-07-13 23:03:35,873 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2022-07-13 23:03:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-13 23:03:35,873 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-13 23:03:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-13 23:03:35,873 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-13 23:03:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-13 23:03:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-13 23:03:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-07-13 23:03:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-07-13 23:03:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-13 23:03:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-07-13 23:03:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-07-13 23:03:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-13 23:03:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-13 23:03:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 23:03:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 23:03:36,124 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 23:03:36,125 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 23:03:37,005 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-13 23:03:39,189 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:03:47,736 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-07-13 23:03:47,736 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-07-13 23:03:47,832 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 23:03:47,841 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 23:03:47,844 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-07-13 23:03:47,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:03:47 BoogieIcfgContainer [2022-07-13 23:03:47,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 23:03:47,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 23:03:47,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 23:03:47,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 23:03:47,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:03:33" (1/3) ... [2022-07-13 23:03:47,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4d3245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:03:47, skipping insertion in model container [2022-07-13 23:03:47,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:35" (2/3) ... [2022-07-13 23:03:47,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4d3245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:03:47, skipping insertion in model container [2022-07-13 23:03:47,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:03:47" (3/3) ... [2022-07-13 23:03:47,854 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-07-13 23:03:47,864 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 23:03:47,864 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 23:03:47,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 23:03:47,942 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d42fbd8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f00a0db [2022-07-13 23:03:47,942 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 23:03:47,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 431 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 316 states have internal predecessors, (411), 91 states have call successors, (91), 35 states have call predecessors, (91), 34 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2022-07-13 23:03:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 23:03:47,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:47,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:47,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:47,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1517292025, now seen corresponding path program 1 times [2022-07-13 23:03:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:03:47,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983011148] [2022-07-13 23:03:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:47,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:03:47,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:03:47,971 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) [2022-07-13 23:03:48,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 23:03:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:48,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:03:48,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:03:48,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:48,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:03:48,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983011148] [2022-07-13 23:03:48,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983011148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:48,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:48,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 23:03:48,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984745839] [2022-07-13 23:03:48,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:48,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:48,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:03:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:03:48,660 INFO L87 Difference]: Start difference. First operand has 431 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 316 states have internal predecessors, (411), 91 states have call successors, (91), 35 states have call predecessors, (91), 34 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:03:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:48,850 INFO L93 Difference]: Finished difference Result 1253 states and 1768 transitions. [2022-07-13 23:03:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:48,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-13 23:03:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:48,872 INFO L225 Difference]: With dead ends: 1253 [2022-07-13 23:03:48,873 INFO L226 Difference]: Without dead ends: 824 [2022-07-13 23:03:48,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:03:48,881 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 539 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:48,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:03:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-07-13 23:03:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2022-07-13 23:03:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 581 states have (on average 1.2581755593803787) internal successors, (731), 593 states have internal predecessors, (731), 173 states have call successors, (173), 66 states have call predecessors, (173), 65 states have return successors, (172), 165 states have call predecessors, (172), 169 states have call successors, (172) [2022-07-13 23:03:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1076 transitions. [2022-07-13 23:03:48,985 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1076 transitions. Word has length 16 [2022-07-13 23:03:48,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:48,985 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1076 transitions. [2022-07-13 23:03:48,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:03:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1076 transitions. [2022-07-13 23:03:48,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 23:03:48,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:48,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:49,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:49,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:03:49,201 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:49,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash 208359179, now seen corresponding path program 1 times [2022-07-13 23:03:49,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:03:49,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766099006] [2022-07-13 23:03:49,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:49,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:03:49,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:03:49,206 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) [2022-07-13 23:03:49,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 23:03:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:49,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:03:49,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:03:49,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:49,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:03:49,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766099006] [2022-07-13 23:03:49,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766099006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:49,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:49,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 23:03:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441123029] [2022-07-13 23:03:49,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:49,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:49,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:03:49,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:49,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:03:49,740 INFO L87 Difference]: Start difference. First operand 820 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:03:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:49,842 INFO L93 Difference]: Finished difference Result 2433 states and 3207 transitions. [2022-07-13 23:03:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:49,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-13 23:03:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:49,853 INFO L225 Difference]: With dead ends: 2433 [2022-07-13 23:03:49,853 INFO L226 Difference]: Without dead ends: 1617 [2022-07-13 23:03:49,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:03:49,858 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 529 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:49,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:03:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2022-07-13 23:03:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1610. [2022-07-13 23:03:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1141 states have (on average 1.2541630148992111) internal successors, (1431), 1160 states have internal predecessors, (1431), 340 states have call successors, (340), 129 states have call predecessors, (340), 128 states have return successors, (346), 328 states have call predecessors, (346), 336 states have call successors, (346) [2022-07-13 23:03:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2022-07-13 23:03:49,937 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 17 [2022-07-13 23:03:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:49,937 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2022-07-13 23:03:49,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 23:03:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2022-07-13 23:03:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 23:03:49,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:49,954 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:49,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:50,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:03:50,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:50,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash 26582145, now seen corresponding path program 1 times [2022-07-13 23:03:50,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:03:50,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723452701] [2022-07-13 23:03:50,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:50,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:03:50,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:03:50,171 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) [2022-07-13 23:03:50,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 23:03:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:50,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 23:03:50,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:03:50,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:50,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:03:50,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723452701] [2022-07-13 23:03:50,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723452701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:50,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:50,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:03:50,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798570168] [2022-07-13 23:03:50,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:50,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:03:50,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:03:50,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:03:50,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:03:50,755 INFO L87 Difference]: Start difference. First operand 1610 states and 2117 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:03:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:50,862 INFO L93 Difference]: Finished difference Result 3212 states and 4225 transitions. [2022-07-13 23:03:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:03:50,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-07-13 23:03:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:50,869 INFO L225 Difference]: With dead ends: 3212 [2022-07-13 23:03:50,869 INFO L226 Difference]: Without dead ends: 1610 [2022-07-13 23:03:50,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:03:50,875 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:50,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2178 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:03:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2022-07-13 23:03:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2022-07-13 23:03:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1141 states have (on average 1.2532865907099036) internal successors, (1430), 1160 states have internal predecessors, (1430), 340 states have call successors, (340), 129 states have call predecessors, (340), 128 states have return successors, (346), 328 states have call predecessors, (346), 336 states have call successors, (346) [2022-07-13 23:03:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2116 transitions. [2022-07-13 23:03:50,919 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2116 transitions. Word has length 71 [2022-07-13 23:03:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:50,920 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2116 transitions. [2022-07-13 23:03:50,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:03:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2116 transitions. [2022-07-13 23:03:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 23:03:50,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:50,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:50,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-13 23:03:51,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:03:51,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2146869344, now seen corresponding path program 1 times [2022-07-13 23:03:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:03:51,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013426234] [2022-07-13 23:03:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:51,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:03:51,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:03:51,143 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) [2022-07-13 23:03:51,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 23:03:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:51,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:03:51,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:03:51,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:51,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:03:51,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013426234] [2022-07-13 23:03:51,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013426234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:51,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:51,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:03:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958147207] [2022-07-13 23:03:51,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:51,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:03:51,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:51,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:03:51,833 INFO L87 Difference]: Start difference. First operand 1610 states and 2116 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:03:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:51,948 INFO L93 Difference]: Finished difference Result 3924 states and 5357 transitions. [2022-07-13 23:03:51,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:51,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-07-13 23:03:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:51,957 INFO L225 Difference]: With dead ends: 3924 [2022-07-13 23:03:51,957 INFO L226 Difference]: Without dead ends: 2325 [2022-07-13 23:03:51,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:03:51,963 INFO L413 NwaCegarLoop]: 629 mSDtfsCounter, 206 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:51,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:03:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-07-13 23:03:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2313. [2022-07-13 23:03:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 1640 states have (on average 1.2939024390243903) internal successors, (2122), 1675 states have internal predecessors, (2122), 544 states have call successors, (544), 129 states have call predecessors, (544), 128 states have return successors, (558), 524 states have call predecessors, (558), 540 states have call successors, (558) [2022-07-13 23:03:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3224 transitions. [2022-07-13 23:03:52,046 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3224 transitions. Word has length 71 [2022-07-13 23:03:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:52,047 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3224 transitions. [2022-07-13 23:03:52,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:03:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3224 transitions. [2022-07-13 23:03:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-13 23:03:52,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:52,049 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:52,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:52,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:03:52,264 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569613, now seen corresponding path program 1 times [2022-07-13 23:03:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:03:52,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91551696] [2022-07-13 23:03:52,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:52,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:03:52,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:03:52,280 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) [2022-07-13 23:03:52,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 23:03:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:52,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:03:52,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:03:52,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:52,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:03:52,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91551696] [2022-07-13 23:03:52,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91551696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:52,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:52,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:03:52,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347620344] [2022-07-13 23:03:52,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:52,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:03:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:03:52,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:03:52,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:03:52,847 INFO L87 Difference]: Start difference. First operand 2313 states and 3224 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 23:03:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:53,265 INFO L93 Difference]: Finished difference Result 6261 states and 9014 transitions. [2022-07-13 23:03:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:03:53,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-07-13 23:03:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:53,282 INFO L225 Difference]: With dead ends: 6261 [2022-07-13 23:03:53,282 INFO L226 Difference]: Without dead ends: 3960 [2022-07-13 23:03:53,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:03:53,290 INFO L413 NwaCegarLoop]: 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 [2022-07-13 23:03:53,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 2062 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 23:03:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2022-07-13 23:03:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 2329. [2022-07-13 23:03:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 1656 states have (on average 1.291062801932367) internal successors, (2138), 1691 states have internal predecessors, (2138), 544 states have call successors, (544), 129 states have call predecessors, (544), 128 states have return successors, (558), 524 states have call predecessors, (558), 540 states have call successors, (558) [2022-07-13 23:03:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3240 transitions. [2022-07-13 23:03:53,389 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3240 transitions. Word has length 68 [2022-07-13 23:03:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:53,390 INFO L495 AbstractCegarLoop]: Abstraction has 2329 states and 3240 transitions. [2022-07-13 23:03:53,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 23:03:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3240 transitions. [2022-07-13 23:03:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 23:03:53,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:53,395 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:53,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:53,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:03:53,612 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:53,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1776712988, now seen corresponding path program 1 times [2022-07-13 23:03:53,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:03:53,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290046293] [2022-07-13 23:03:53,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:53,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:03:53,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:03:53,615 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) [2022-07-13 23:03:53,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 23:03:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:54,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:03:54,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:03:54,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:54,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:03:54,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290046293] [2022-07-13 23:03:54,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290046293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:54,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:54,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:03:54,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73102007] [2022-07-13 23:03:54,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:54,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:03:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:03:54,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:03:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:03:54,272 INFO L87 Difference]: Start difference. First operand 2329 states and 3240 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 23:03:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:54,652 INFO L93 Difference]: Finished difference Result 5821 states and 8310 transitions. [2022-07-13 23:03:54,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:03:54,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-07-13 23:03:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:54,666 INFO L225 Difference]: With dead ends: 5821 [2022-07-13 23:03:54,667 INFO L226 Difference]: Without dead ends: 3504 [2022-07-13 23:03:54,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:03:54,673 INFO L413 NwaCegarLoop]: 823 mSDtfsCounter, 336 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:54,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 2023 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 23:03:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2022-07-13 23:03:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 2345. [2022-07-13 23:03:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 1672 states have (on average 1.2882775119617225) internal successors, (2154), 1707 states have internal predecessors, (2154), 544 states have call successors, (544), 129 states have call predecessors, (544), 128 states have return successors, (558), 524 states have call predecessors, (558), 540 states have call successors, (558) [2022-07-13 23:03:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3256 transitions. [2022-07-13 23:03:54,760 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3256 transitions. Word has length 69 [2022-07-13 23:03:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:54,760 INFO L495 AbstractCegarLoop]: Abstraction has 2345 states and 3256 transitions. [2022-07-13 23:03:54,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 23:03:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3256 transitions. [2022-07-13 23:03:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 23:03:54,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:54,764 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:54,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-13 23:03:54,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:03:54,980 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:54,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash 676145405, now seen corresponding path program 1 times [2022-07-13 23:03:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:03:54,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859222995] [2022-07-13 23:03:54,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:54,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:03:54,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:03:54,982 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) [2022-07-13 23:03:54,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 23:03:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:55,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 23:03:55,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:03:56,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:56,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:03:56,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859222995] [2022-07-13 23:03:56,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859222995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:56,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:56,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:03:56,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562961479] [2022-07-13 23:03:56,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:56,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:03:56,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:03:56,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:03:56,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:03:56,026 INFO L87 Difference]: Start difference. First operand 2345 states and 3256 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 23:03:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:56,300 INFO L93 Difference]: Finished difference Result 3553 states and 4967 transitions. [2022-07-13 23:03:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:03:56,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-07-13 23:03:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:56,312 INFO L225 Difference]: With dead ends: 3553 [2022-07-13 23:03:56,312 INFO L226 Difference]: Without dead ends: 2377 [2022-07-13 23:03:56,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:03:56,317 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 2 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:56,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3254 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 23:03:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-07-13 23:03:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2377. [2022-07-13 23:03:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 1694 states have (on average 1.2845336481700118) internal successors, (2176), 1731 states have internal predecessors, (2176), 544 states have call successors, (544), 129 states have call predecessors, (544), 138 states have return successors, (592), 532 states have call predecessors, (592), 540 states have call successors, (592) [2022-07-13 23:03:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3312 transitions. [2022-07-13 23:03:56,434 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3312 transitions. Word has length 69 [2022-07-13 23:03:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:56,435 INFO L495 AbstractCegarLoop]: Abstraction has 2377 states and 3312 transitions. [2022-07-13 23:03:56,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 23:03:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3312 transitions. [2022-07-13 23:03:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 23:03:56,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:56,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:56,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:56,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:03:56,656 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:56,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958436, now seen corresponding path program 1 times [2022-07-13 23:03:56,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:03:56,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268735218] [2022-07-13 23:03:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:56,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:03:56,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:03:56,668 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) [2022-07-13 23:03:56,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 23:03:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:57,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 23:03:57,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:03:57,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:57,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:03:57,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268735218] [2022-07-13 23:03:57,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268735218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:57,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:57,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 23:03:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729292614] [2022-07-13 23:03:57,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:57,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 23:03:57,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:03:57,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 23:03:57,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:03:57,765 INFO L87 Difference]: Start difference. First operand 2377 states and 3312 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 23:03:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:59,233 INFO L93 Difference]: Finished difference Result 5537 states and 7892 transitions. [2022-07-13 23:03:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:03:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-07-13 23:03:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:59,249 INFO L225 Difference]: With dead ends: 5537 [2022-07-13 23:03:59,249 INFO L226 Difference]: Without dead ends: 3172 [2022-07-13 23:03:59,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-13 23:03:59,257 INFO L413 NwaCegarLoop]: 910 mSDtfsCounter, 217 mSDsluCounter, 6888 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 7798 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:59,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 7798 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 23:03:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2022-07-13 23:03:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 2381. [2022-07-13 23:03:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 1698 states have (on average 1.28150765606596) internal successors, (2176), 1733 states have internal predecessors, (2176), 544 states have call successors, (544), 129 states have call predecessors, (544), 138 states have return successors, (592), 534 states have call predecessors, (592), 540 states have call successors, (592) [2022-07-13 23:03:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3312 transitions. [2022-07-13 23:03:59,352 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3312 transitions. Word has length 69 [2022-07-13 23:03:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:59,353 INFO L495 AbstractCegarLoop]: Abstraction has 2381 states and 3312 transitions. [2022-07-13 23:03:59,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 23:03:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3312 transitions. [2022-07-13 23:03:59,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 23:03:59,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:59,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:03:59,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:59,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:03:59,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1395829828, now seen corresponding path program 1 times [2022-07-13 23:03:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:03:59,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137117297] [2022-07-13 23:03:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:59,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:03:59,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:03:59,575 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) [2022-07-13 23:03:59,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 23:04:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:00,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 23:04:00,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:04:00,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:00,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:00,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137117297] [2022-07-13 23:04:00,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137117297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:00,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:00,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:04:00,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711651402] [2022-07-13 23:04:00,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:00,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:04:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:04:00,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:04:00,293 INFO L87 Difference]: Start difference. First operand 2381 states and 3312 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:04:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:00,619 INFO L93 Difference]: Finished difference Result 5691 states and 8110 transitions. [2022-07-13 23:04:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:04:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-07-13 23:04:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:00,633 INFO L225 Difference]: With dead ends: 5691 [2022-07-13 23:04:00,634 INFO L226 Difference]: Without dead ends: 3322 [2022-07-13 23:04:00,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:04:00,641 INFO L413 NwaCegarLoop]: 823 mSDtfsCounter, 168 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:00,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 3048 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 23:04:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2022-07-13 23:04:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 2171. [2022-07-13 23:04:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 1554 states have (on average 1.2715572715572716) internal successors, (1976), 1573 states have internal predecessors, (1976), 480 states have call successors, (480), 127 states have call predecessors, (480), 136 states have return successors, (526), 478 states have call predecessors, (526), 476 states have call successors, (526) [2022-07-13 23:04:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2982 transitions. [2022-07-13 23:04:00,726 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2982 transitions. Word has length 75 [2022-07-13 23:04:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:00,726 INFO L495 AbstractCegarLoop]: Abstraction has 2171 states and 2982 transitions. [2022-07-13 23:04:00,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:04:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2982 transitions. [2022-07-13 23:04:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 23:04:00,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:00,728 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:00,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:00,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:04:00,962 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -506709307, now seen corresponding path program 1 times [2022-07-13 23:04:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:00,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440787012] [2022-07-13 23:04:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:00,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:00,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:00,964 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) [2022-07-13 23:04:00,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 23:04:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:01,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 23:04:01,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:04:02,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:02,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:02,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440787012] [2022-07-13 23:04:02,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440787012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:02,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:02,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:04:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070935037] [2022-07-13 23:04:02,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:02,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:04:02,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:02,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:04:02,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:04:02,311 INFO L87 Difference]: Start difference. First operand 2171 states and 2982 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 23:04:04,747 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 [] [2022-07-13 23:04:06,762 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 [] [2022-07-13 23:04:10,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:12,070 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 [] [2022-07-13 23:04:13,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:15,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:17,403 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 [] [2022-07-13 23:04:19,412 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 [] [2022-07-13 23:04:23,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:26,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:30,890 INFO L93 Difference]: Finished difference Result 5559 states and 7703 transitions. [2022-07-13 23:04:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 23:04:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2022-07-13 23:04:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:30,911 INFO L225 Difference]: With dead ends: 5559 [2022-07-13 23:04:30,912 INFO L226 Difference]: Without dead ends: 4349 [2022-07-13 23:04:30,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:04:30,917 INFO L413 NwaCegarLoop]: 977 mSDtfsCounter, 1148 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 316 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:30,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 2482 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1823 Invalid, 6 Unknown, 0 Unchecked, 28.1s Time] [2022-07-13 23:04:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4349 states. [2022-07-13 23:04:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4349 to 3357. [2022-07-13 23:04:31,072 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) [2022-07-13 23:04:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4649 transitions. [2022-07-13 23:04:31,080 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4649 transitions. Word has length 75 [2022-07-13 23:04:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:31,080 INFO L495 AbstractCegarLoop]: Abstraction has 3357 states and 4649 transitions. [2022-07-13 23:04:31,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 23:04:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4649 transitions. [2022-07-13 23:04:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 23:04:31,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:31,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:31,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:31,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:04:31,297 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash -418091033, now seen corresponding path program 1 times [2022-07-13 23:04:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:31,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142685056] [2022-07-13 23:04:31,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:31,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:31,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:31,310 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) [2022-07-13 23:04:31,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 23:04:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:32,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:04:32,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:04:32,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:32,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:32,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142685056] [2022-07-13 23:04:32,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142685056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:32,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:32,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:04:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226816423] [2022-07-13 23:04:32,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:32,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:04:32,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:32,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:04:32,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:04:32,260 INFO L87 Difference]: Start difference. First operand 3357 states and 4649 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) [2022-07-13 23:04:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:32,392 INFO L93 Difference]: Finished difference Result 6708 states and 9388 transitions. [2022-07-13 23:04:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:04:32,393 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 94 [2022-07-13 23:04:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:32,402 INFO L225 Difference]: With dead ends: 6708 [2022-07-13 23:04:32,403 INFO L226 Difference]: Without dead ends: 3363 [2022-07-13 23:04:32,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:04:32,410 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:32,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1088 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:04:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2022-07-13 23:04:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3363. [2022-07-13 23:04:32,551 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) [2022-07-13 23:04:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4655 transitions. [2022-07-13 23:04:32,565 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4655 transitions. Word has length 94 [2022-07-13 23:04:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:32,565 INFO L495 AbstractCegarLoop]: Abstraction has 3363 states and 4655 transitions. [2022-07-13 23:04:32,566 INFO L496 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) [2022-07-13 23:04:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4655 transitions. [2022-07-13 23:04:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 23:04:32,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:32,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:32,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:32,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:04:32,786 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:32,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1449980852, now seen corresponding path program 1 times [2022-07-13 23:04:32,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:32,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904019151] [2022-07-13 23:04:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:32,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:32,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:32,789 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) [2022-07-13 23:04:32,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 23:04:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:33,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 23:04:33,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:04:33,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:04:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:04:33,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:33,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904019151] [2022-07-13 23:04:33,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904019151] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:04:33,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:04:33,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-13 23:04:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506246177] [2022-07-13 23:04:33,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:04:33,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:04:33,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:33,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:04:33,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:04:33,707 INFO L87 Difference]: Start difference. First operand 3363 states and 4655 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 23:04:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:34,034 INFO L93 Difference]: Finished difference Result 6732 states and 9424 transitions. [2022-07-13 23:04:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:04:34,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 95 [2022-07-13 23:04:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:34,045 INFO L225 Difference]: With dead ends: 6732 [2022-07-13 23:04:34,045 INFO L226 Difference]: Without dead ends: 3381 [2022-07-13 23:04:34,052 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:04:34,053 INFO L413 NwaCegarLoop]: 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 [2022-07-13 23:04:34,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2174 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:04:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2022-07-13 23:04:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3381. [2022-07-13 23:04:34,160 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) [2022-07-13 23:04:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4673 transitions. [2022-07-13 23:04:34,194 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4673 transitions. Word has length 95 [2022-07-13 23:04:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:34,194 INFO L495 AbstractCegarLoop]: Abstraction has 3381 states and 4673 transitions. [2022-07-13 23:04:34,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 23:04:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4673 transitions. [2022-07-13 23:04:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 23:04:34,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:34,199 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:34,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:34,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:04:34,401 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:34,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash 989690663, now seen corresponding path program 2 times [2022-07-13 23:04:34,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:34,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669741369] [2022-07-13 23:04:34,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 23:04:34,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:34,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:34,404 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) [2022-07-13 23:04:34,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 23:04:34,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 23:04:34,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 23:04:34,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 23:04:34,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 23:04:35,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:35,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:35,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669741369] [2022-07-13 23:04:35,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669741369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:35,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:35,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:04:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957055978] [2022-07-13 23:04:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:35,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:04:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:04:35,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:04:35,195 INFO L87 Difference]: Start difference. First operand 3381 states and 4673 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 23:04:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:35,460 INFO L93 Difference]: Finished difference Result 6768 states and 9395 transitions. [2022-07-13 23:04:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:04:35,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2022-07-13 23:04:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:35,469 INFO L225 Difference]: With dead ends: 6768 [2022-07-13 23:04:35,469 INFO L226 Difference]: Without dead ends: 3399 [2022-07-13 23:04:35,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:04:35,477 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 2 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:35,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3297 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:04:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2022-07-13 23:04:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3387. [2022-07-13 23:04:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 2432 states have (on average 1.270970394736842) internal successors, (3091), 2460 states have internal predecessors, (3091), 748 states have call successors, (748), 189 states have call predecessors, (748), 206 states have return successors, (840), 757 states have call predecessors, (840), 744 states have call successors, (840) [2022-07-13 23:04:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4679 transitions. [2022-07-13 23:04:35,608 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4679 transitions. Word has length 98 [2022-07-13 23:04:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:35,608 INFO L495 AbstractCegarLoop]: Abstraction has 3387 states and 4679 transitions. [2022-07-13 23:04:35,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 23:04:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4679 transitions. [2022-07-13 23:04:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 23:04:35,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:35,612 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:35,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:35,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:04:35,827 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:35,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1398514888, now seen corresponding path program 1 times [2022-07-13 23:04:35,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:35,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068732891] [2022-07-13 23:04:35,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:35,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:35,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:35,830 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) [2022-07-13 23:04:35,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 23:04:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:36,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 23:04:36,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 23:04:36,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:36,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:36,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068732891] [2022-07-13 23:04:36,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068732891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:36,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:36,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:04:36,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372857555] [2022-07-13 23:04:36,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:36,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:04:36,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:36,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:04:36,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:04:36,662 INFO L87 Difference]: Start difference. First operand 3387 states and 4679 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 23:04:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:37,652 INFO L93 Difference]: Finished difference Result 8281 states and 11717 transitions. [2022-07-13 23:04:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:04:37,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2022-07-13 23:04:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:37,664 INFO L225 Difference]: With dead ends: 8281 [2022-07-13 23:04:37,664 INFO L226 Difference]: Without dead ends: 4906 [2022-07-13 23:04:37,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:04:37,671 INFO L413 NwaCegarLoop]: 759 mSDtfsCounter, 173 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 2838 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:37,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 2838 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:04:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2022-07-13 23:04:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 3275. [2022-07-13 23:04:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 2372 states have (on average 1.2689713322091063) internal successors, (3010), 2385 states have internal predecessors, (3010), 706 states have call successors, (706), 179 states have call predecessors, (706), 196 states have return successors, (794), 730 states have call predecessors, (794), 702 states have call successors, (794) [2022-07-13 23:04:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4510 transitions. [2022-07-13 23:04:37,852 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4510 transitions. Word has length 98 [2022-07-13 23:04:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:37,852 INFO L495 AbstractCegarLoop]: Abstraction has 3275 states and 4510 transitions. [2022-07-13 23:04:37,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 23:04:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4510 transitions. [2022-07-13 23:04:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 23:04:37,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:37,855 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:37,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:38,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:04:38,075 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:38,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:38,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1871827029, now seen corresponding path program 1 times [2022-07-13 23:04:38,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:38,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39767514] [2022-07-13 23:04:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:38,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:38,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:38,085 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) [2022-07-13 23:04:38,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-13 23:04:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:38,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 23:04:38,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:04:38,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:38,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:38,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39767514] [2022-07-13 23:04:38,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39767514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:38,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:38,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:04:38,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47188637] [2022-07-13 23:04:38,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:38,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:04:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:04:38,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:04:38,894 INFO L87 Difference]: Start difference. First operand 3275 states and 4510 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:04:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:39,244 INFO L93 Difference]: Finished difference Result 8021 states and 11370 transitions. [2022-07-13 23:04:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:04:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2022-07-13 23:04:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:39,261 INFO L225 Difference]: With dead ends: 8021 [2022-07-13 23:04:39,261 INFO L226 Difference]: Without dead ends: 4758 [2022-07-13 23:04:39,269 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:04:39,270 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 168 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:39,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 3060 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:04:39,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2022-07-13 23:04:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 3091. [2022-07-13 23:04:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3091 states, 2244 states have (on average 1.2629233511586453) internal successors, (2834), 2245 states have internal predecessors, (2834), 650 states have call successors, (650), 177 states have call predecessors, (650), 196 states have return successors, (744), 684 states have call predecessors, (744), 646 states have call successors, (744) [2022-07-13 23:04:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 4228 transitions. [2022-07-13 23:04:39,468 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 4228 transitions. Word has length 87 [2022-07-13 23:04:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:39,468 INFO L495 AbstractCegarLoop]: Abstraction has 3091 states and 4228 transitions. [2022-07-13 23:04:39,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:04:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 4228 transitions. [2022-07-13 23:04:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 23:04:39,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:39,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:39,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:39,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:04:39,687 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:39,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:39,688 INFO L85 PathProgramCache]: Analyzing trace with hash -205382314, now seen corresponding path program 1 times [2022-07-13 23:04:39,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:39,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119306364] [2022-07-13 23:04:39,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:39,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:39,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:39,696 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) [2022-07-13 23:04:39,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-13 23:04:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:40,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 23:04:40,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:04:40,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:40,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:40,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119306364] [2022-07-13 23:04:40,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119306364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:40,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:40,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:04:40,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195401238] [2022-07-13 23:04:40,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:40,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:04:40,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:40,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:04:40,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:04:40,723 INFO L87 Difference]: Start difference. First operand 3091 states and 4228 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 23:04:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:40,978 INFO L93 Difference]: Finished difference Result 4754 states and 6531 transitions. [2022-07-13 23:04:40,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:04:40,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2022-07-13 23:04:40,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:41,011 INFO L225 Difference]: With dead ends: 4754 [2022-07-13 23:04:41,011 INFO L226 Difference]: Without dead ends: 3091 [2022-07-13 23:04:41,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:04:41,015 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 2 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3248 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:41,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3248 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:04:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states. [2022-07-13 23:04:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 3091. [2022-07-13 23:04:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3091 states, 2244 states have (on average 1.2611408199643495) internal successors, (2830), 2245 states have internal predecessors, (2830), 650 states have call successors, (650), 177 states have call predecessors, (650), 196 states have return successors, (744), 684 states have call predecessors, (744), 646 states have call successors, (744) [2022-07-13 23:04:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 4224 transitions. [2022-07-13 23:04:41,348 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 4224 transitions. Word has length 87 [2022-07-13 23:04:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:41,349 INFO L495 AbstractCegarLoop]: Abstraction has 3091 states and 4224 transitions. [2022-07-13 23:04:41,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 23:04:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 4224 transitions. [2022-07-13 23:04:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 23:04:41,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:41,368 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:41,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:41,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:04:41,583 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2079481141, now seen corresponding path program 1 times [2022-07-13 23:04:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:41,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865488464] [2022-07-13 23:04:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:41,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:41,586 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) [2022-07-13 23:04:41,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-13 23:04:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:42,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:04:42,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:04:42,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:42,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:42,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865488464] [2022-07-13 23:04:42,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865488464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:42,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:42,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:04:42,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403301304] [2022-07-13 23:04:42,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:42,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:04:42,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:42,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:04:42,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:04:42,203 INFO L87 Difference]: Start difference. First operand 3091 states and 4224 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:04:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:42,547 INFO L93 Difference]: Finished difference Result 5753 states and 8082 transitions. [2022-07-13 23:04:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:04:42,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2022-07-13 23:04:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:42,556 INFO L225 Difference]: With dead ends: 5753 [2022-07-13 23:04:42,557 INFO L226 Difference]: Without dead ends: 4090 [2022-07-13 23:04:42,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:04:42,560 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 197 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:42,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1451 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 23:04:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2022-07-13 23:04:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 3099. [2022-07-13 23:04:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2252 states have (on average 1.2602131438721136) internal successors, (2838), 2253 states have internal predecessors, (2838), 650 states have call successors, (650), 177 states have call predecessors, (650), 196 states have return successors, (744), 684 states have call predecessors, (744), 646 states have call successors, (744) [2022-07-13 23:04:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4232 transitions. [2022-07-13 23:04:42,704 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4232 transitions. Word has length 87 [2022-07-13 23:04:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:42,705 INFO L495 AbstractCegarLoop]: Abstraction has 3099 states and 4232 transitions. [2022-07-13 23:04:42,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:04:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4232 transitions. [2022-07-13 23:04:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 23:04:42,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:42,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:42,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:42,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:04:42,922 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:42,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:42,923 INFO L85 PathProgramCache]: Analyzing trace with hash 390816807, now seen corresponding path program 1 times [2022-07-13 23:04:42,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:42,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497383644] [2022-07-13 23:04:42,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:42,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:42,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:42,925 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) [2022-07-13 23:04:42,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-13 23:04:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:43,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:04:43,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:04:43,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:43,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:43,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497383644] [2022-07-13 23:04:43,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497383644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:43,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:43,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:04:43,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940493065] [2022-07-13 23:04:43,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:43,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:04:43,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:43,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:04:43,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:04:43,547 INFO L87 Difference]: Start difference. First operand 3099 states and 4232 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 23:04:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:43,841 INFO L93 Difference]: Finished difference Result 6248 states and 8519 transitions. [2022-07-13 23:04:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:04:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2022-07-13 23:04:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:43,849 INFO L225 Difference]: With dead ends: 6248 [2022-07-13 23:04:43,849 INFO L226 Difference]: Without dead ends: 3155 [2022-07-13 23:04:43,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:04:43,853 INFO L413 NwaCegarLoop]: 555 mSDtfsCounter, 16 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:43,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1645 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:04:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2022-07-13 23:04:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 3117. [2022-07-13 23:04:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 2264 states have (on average 1.25839222614841) internal successors, (2849), 2265 states have internal predecessors, (2849), 653 states have call successors, (653), 180 states have call predecessors, (653), 199 states have return successors, (747), 687 states have call predecessors, (747), 649 states have call successors, (747) [2022-07-13 23:04:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4249 transitions. [2022-07-13 23:04:43,969 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4249 transitions. Word has length 94 [2022-07-13 23:04:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:43,969 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4249 transitions. [2022-07-13 23:04:43,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 23:04:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4249 transitions. [2022-07-13 23:04:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 23:04:43,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:43,971 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:43,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-13 23:04:44,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:04:44,184 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:44,184 INFO L85 PathProgramCache]: Analyzing trace with hash -153386871, now seen corresponding path program 1 times [2022-07-13 23:04:44,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:44,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269067029] [2022-07-13 23:04:44,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:44,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:44,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:44,191 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) [2022-07-13 23:04:44,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-13 23:04:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:44,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 23:04:44,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 23:04:45,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:45,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:45,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269067029] [2022-07-13 23:04:45,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269067029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:45,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:45,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 23:04:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091288352] [2022-07-13 23:04:45,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:45,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 23:04:45,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 23:04:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:04:45,363 INFO L87 Difference]: Start difference. First operand 3117 states and 4249 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 23:04:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:47,267 INFO L93 Difference]: Finished difference Result 8108 states and 11409 transitions. [2022-07-13 23:04:47,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:04:47,268 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2022-07-13 23:04:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:47,279 INFO L225 Difference]: With dead ends: 8108 [2022-07-13 23:04:47,295 INFO L226 Difference]: Without dead ends: 5003 [2022-07-13 23:04:47,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-13 23:04:47,301 INFO L413 NwaCegarLoop]: 815 mSDtfsCounter, 228 mSDsluCounter, 6187 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 7002 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:47,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 7002 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-13 23:04:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2022-07-13 23:04:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 3117. [2022-07-13 23:04:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 2264 states have (on average 1.2548586572438163) internal successors, (2841), 2265 states have internal predecessors, (2841), 653 states have call successors, (653), 180 states have call predecessors, (653), 199 states have return successors, (747), 687 states have call predecessors, (747), 649 states have call successors, (747) [2022-07-13 23:04:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4241 transitions. [2022-07-13 23:04:47,478 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4241 transitions. Word has length 96 [2022-07-13 23:04:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:47,478 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4241 transitions. [2022-07-13 23:04:47,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 23:04:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4241 transitions. [2022-07-13 23:04:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 23:04:47,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:47,480 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:47,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-13 23:04:47,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:04:47,700 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:47,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:47,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1118734186, now seen corresponding path program 1 times [2022-07-13 23:04:47,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:47,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299099143] [2022-07-13 23:04:47,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:47,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:47,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:47,702 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) [2022-07-13 23:04:47,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-13 23:04:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:48,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 23:04:48,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:04:49,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:04:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 23:04:50,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:50,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299099143] [2022-07-13 23:04:50,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299099143] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 23:04:50,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:04:50,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-13 23:04:50,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729307826] [2022-07-13 23:04:50,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:50,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:04:50,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:50,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:04:50,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:04:50,289 INFO L87 Difference]: Start difference. First operand 3117 states and 4241 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 23:04:52,552 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 [] [2022-07-13 23:04:55,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:57,517 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 [] [2022-07-13 23:05:00,352 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 [] [2022-07-13 23:05:03,684 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:05:05,978 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 [] [2022-07-13 23:05:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:09,014 INFO L93 Difference]: Finished difference Result 6321 states and 8621 transitions. [2022-07-13 23:05:09,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:05:09,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 89 [2022-07-13 23:05:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:09,041 INFO L225 Difference]: With dead ends: 6321 [2022-07-13 23:05:09,042 INFO L226 Difference]: Without dead ends: 6318 [2022-07-13 23:05:09,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:05:09,046 INFO L413 NwaCegarLoop]: 1010 mSDtfsCounter, 1818 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 551 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:05:09,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 1497 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 871 Invalid, 4 Unknown, 0 Unchecked, 18.1s Time] [2022-07-13 23:05:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6318 states. [2022-07-13 23:05:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6318 to 6209. [2022-07-13 23:05:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6209 states, 4504 states have (on average 1.258214920071048) internal successors, (5667), 4497 states have internal predecessors, (5667), 1311 states have call successors, (1311), 354 states have call predecessors, (1311), 393 states have return successors, (1529), 1393 states have call predecessors, (1529), 1307 states have call successors, (1529) [2022-07-13 23:05:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 8507 transitions. [2022-07-13 23:05:09,516 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 8507 transitions. Word has length 89 [2022-07-13 23:05:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:09,516 INFO L495 AbstractCegarLoop]: Abstraction has 6209 states and 8507 transitions. [2022-07-13 23:05:09,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 23:05:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 8507 transitions. [2022-07-13 23:05:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 23:05:09,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:09,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:05:09,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-13 23:05:09,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:05:09,741 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:09,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:09,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1748979270, now seen corresponding path program 1 times [2022-07-13 23:05:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:05:09,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195445544] [2022-07-13 23:05:09,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:09,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:05:09,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:05:09,752 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) [2022-07-13 23:05:09,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-13 23:05:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:10,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 23:05:10,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:05:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:05:11,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:05:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:05:12,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:05:12,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195445544] [2022-07-13 23:05:12,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195445544] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:05:12,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:05:12,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2022-07-13 23:05:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342921483] [2022-07-13 23:05:12,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:05:12,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 23:05:12,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:05:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 23:05:12,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:05:12,270 INFO L87 Difference]: Start difference. First operand 6209 states and 8507 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 10 states have internal predecessors, (79), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 23:05:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:14,829 INFO L93 Difference]: Finished difference Result 15718 states and 22299 transitions. [2022-07-13 23:05:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 23:05:14,830 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 10 states have internal predecessors, (79), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 3 states have call successors, (13) Word has length 94 [2022-07-13 23:05:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:14,855 INFO L225 Difference]: With dead ends: 15718 [2022-07-13 23:05:14,856 INFO L226 Difference]: Without dead ends: 9521 [2022-07-13 23:05:14,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:05:14,869 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 221 mSDsluCounter, 7795 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 8616 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:05:14,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 8616 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-13 23:05:14,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9521 states. [2022-07-13 23:05:15,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9521 to 6211. [2022-07-13 23:05:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6211 states, 4502 states have (on average 1.258329631274989) internal successors, (5665), 4505 states have internal predecessors, (5665), 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) [2022-07-13 23:05:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 8515 transitions. [2022-07-13 23:05:15,386 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 8515 transitions. Word has length 94 [2022-07-13 23:05:15,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:15,386 INFO L495 AbstractCegarLoop]: Abstraction has 6211 states and 8515 transitions. [2022-07-13 23:05:15,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 10 states have internal predecessors, (79), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 23:05:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 8515 transitions. [2022-07-13 23:05:15,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 23:05:15,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:15,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:05:15,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-13 23:05:15,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:05:15,604 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:15,604 INFO L85 PathProgramCache]: Analyzing trace with hash 832679025, now seen corresponding path program 1 times [2022-07-13 23:05:15,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:05:15,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622376881] [2022-07-13 23:05:15,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:15,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:05:15,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:05:15,611 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) [2022-07-13 23:05:15,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-13 23:05:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:16,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 23:05:16,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:05:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:05:16,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:05:16,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:05:16,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622376881] [2022-07-13 23:05:16,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622376881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:05:16,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:05:16,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 23:05:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857368240] [2022-07-13 23:05:16,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:05:16,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 23:05:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:05:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 23:05:16,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:05:16,806 INFO L87 Difference]: Start difference. First operand 6211 states and 8515 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 23:05:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:18,716 INFO L93 Difference]: Finished difference Result 13458 states and 19018 transitions. [2022-07-13 23:05:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:05:18,717 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2022-07-13 23:05:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:18,776 INFO L225 Difference]: With dead ends: 13458 [2022-07-13 23:05:18,777 INFO L226 Difference]: Without dead ends: 8677 [2022-07-13 23:05:18,830 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:05:18,831 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 213 mSDsluCounter, 6341 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 7176 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:05:18,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 7176 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 23:05:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8677 states. [2022-07-13 23:05:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8677 to 6211. [2022-07-13 23:05:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6211 states, 4502 states have (on average 1.2565526432696579) internal successors, (5657), 4505 states have internal predecessors, (5657), 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) [2022-07-13 23:05:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 8507 transitions. [2022-07-13 23:05:19,460 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 8507 transitions. Word has length 97 [2022-07-13 23:05:19,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:19,460 INFO L495 AbstractCegarLoop]: Abstraction has 6211 states and 8507 transitions. [2022-07-13 23:05:19,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 23:05:19,461 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 8507 transitions. [2022-07-13 23:05:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 23:05:19,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:19,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:05:19,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-13 23:05:19,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:05:19,677 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:19,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1118058599, now seen corresponding path program 1 times [2022-07-13 23:05:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:05:19,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293051851] [2022-07-13 23:05:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:19,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:05:19,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:05:19,680 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) [2022-07-13 23:05:19,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-13 23:05:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:20,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 23:05:20,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:05:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 23:05:20,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:05:20,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:05:20,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293051851] [2022-07-13 23:05:20,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293051851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:05:20,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:05:20,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:05:20,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548647452] [2022-07-13 23:05:20,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:05:20,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:05:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:05:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:05:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:05:20,604 INFO L87 Difference]: Start difference. First operand 6211 states and 8507 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 23:05:22,784 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 [] [2022-07-13 23:05:25,080 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 [] [2022-07-13 23:05:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:25,194 INFO L93 Difference]: Finished difference Result 12479 states and 17093 transitions. [2022-07-13 23:05:25,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:05:25,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2022-07-13 23:05:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:25,248 INFO L225 Difference]: With dead ends: 12479 [2022-07-13 23:05:25,248 INFO L226 Difference]: Without dead ends: 6277 [2022-07-13 23:05:25,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:05:25,279 INFO L413 NwaCegarLoop]: 559 mSDtfsCounter, 18 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:05:25,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2765 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 23:05:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2022-07-13 23:05:25,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 6220. [2022-07-13 23:05:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6220 states, 4511 states have (on average 1.2560407891819996) internal successors, (5666), 4511 states have internal predecessors, (5666), 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) [2022-07-13 23:05:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 8515 transitions. [2022-07-13 23:05:25,785 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 8515 transitions. Word has length 108 [2022-07-13 23:05:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:25,786 INFO L495 AbstractCegarLoop]: Abstraction has 6220 states and 8515 transitions. [2022-07-13 23:05:25,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 23:05:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 8515 transitions. [2022-07-13 23:05:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 23:05:25,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:25,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:05:25,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-13 23:05:26,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:05:26,008 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:26,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:26,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1967666458, now seen corresponding path program 1 times [2022-07-13 23:05:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:05:26,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75393425] [2022-07-13 23:05:26,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:26,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:05:26,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:05:26,010 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) [2022-07-13 23:05:26,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-13 23:05:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:26,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:05:26,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:05:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 23:05:26,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:05:26,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:05:26,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75393425] [2022-07-13 23:05:26,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75393425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:05:26,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:05:26,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:05:26,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432987487] [2022-07-13 23:05:26,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:05:26,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:05:26,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:05:26,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:05:26,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:05:26,792 INFO L87 Difference]: Start difference. First operand 6220 states and 8515 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 23:05:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:27,182 INFO L93 Difference]: Finished difference Result 12464 states and 17066 transitions. [2022-07-13 23:05:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:05:27,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2022-07-13 23:05:27,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:27,197 INFO L225 Difference]: With dead ends: 12464 [2022-07-13 23:05:27,198 INFO L226 Difference]: Without dead ends: 6256 [2022-07-13 23:05:27,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:05:27,205 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 1 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:05:27,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1085 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:05:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6256 states. [2022-07-13 23:05:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6256 to 6244. [2022-07-13 23:05:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6244 states, 4535 states have (on average 1.2546857772877618) internal successors, (5690), 4535 states have internal predecessors, (5690), 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) [2022-07-13 23:05:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6244 states to 6244 states and 8539 transitions. [2022-07-13 23:05:27,553 INFO L78 Accepts]: Start accepts. Automaton has 6244 states and 8539 transitions. Word has length 108 [2022-07-13 23:05:27,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:27,553 INFO L495 AbstractCegarLoop]: Abstraction has 6244 states and 8539 transitions. [2022-07-13 23:05:27,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 23:05:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 6244 states and 8539 transitions. [2022-07-13 23:05:27,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-13 23:05:27,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:27,555 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:05:27,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-13 23:05:27,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:05:27,775 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:27,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:27,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2053204873, now seen corresponding path program 1 times [2022-07-13 23:05:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:05:27,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436499672] [2022-07-13 23:05:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:27,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:05:27,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:05:27,777 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) [2022-07-13 23:05:27,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-13 23:05:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:28,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 23:05:28,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:05:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 23:05:29,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:05:29,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:05:29,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436499672] [2022-07-13 23:05:29,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436499672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:05:29,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:05:29,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 23:05:29,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601236753] [2022-07-13 23:05:29,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:05:29,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 23:05:29,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:05:29,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 23:05:29,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:05:29,453 INFO L87 Difference]: Start difference. First operand 6244 states and 8539 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:05:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:31,689 INFO L93 Difference]: Finished difference Result 13485 states and 19006 transitions. [2022-07-13 23:05:31,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 23:05:31,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-07-13 23:05:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:31,708 INFO L225 Difference]: With dead ends: 13485 [2022-07-13 23:05:31,708 INFO L226 Difference]: Without dead ends: 8677 [2022-07-13 23:05:31,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-13 23:05:31,718 INFO L413 NwaCegarLoop]: 827 mSDtfsCounter, 209 mSDsluCounter, 7917 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 8744 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-13 23:05:31,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 8744 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-13 23:05:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8677 states. [2022-07-13 23:05:32,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8677 to 6188. [2022-07-13 23:05:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6188 states, 4505 states have (on average 1.2546059933407325) internal successors, (5652), 4515 states have internal predecessors, (5652), 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) [2022-07-13 23:05:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6188 states to 6188 states and 8441 transitions. [2022-07-13 23:05:32,130 INFO L78 Accepts]: Start accepts. Automaton has 6188 states and 8441 transitions. Word has length 104 [2022-07-13 23:05:32,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:32,130 INFO L495 AbstractCegarLoop]: Abstraction has 6188 states and 8441 transitions. [2022-07-13 23:05:32,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:05:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 6188 states and 8441 transitions. [2022-07-13 23:05:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-13 23:05:32,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:32,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:05:32,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-13 23:05:32,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:05:32,352 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:32,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:32,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1396982830, now seen corresponding path program 1 times [2022-07-13 23:05:32,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:05:32,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471276801] [2022-07-13 23:05:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:32,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:05:32,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:05:32,355 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) [2022-07-13 23:05:32,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-13 23:05:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:33,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:05:33,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:05:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 23:05:33,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:05:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 23:05:33,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:05:33,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471276801] [2022-07-13 23:05:33,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471276801] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:05:33,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:05:33,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-13 23:05:33,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120835646] [2022-07-13 23:05:33,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:05:33,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:05:33,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:05:33,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:05:33,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:05:33,350 INFO L87 Difference]: Start difference. First operand 6188 states and 8441 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-13 23:05:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:33,996 INFO L93 Difference]: Finished difference Result 12472 states and 17014 transitions. [2022-07-13 23:05:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:05:33,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2022-07-13 23:05:33,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:34,016 INFO L225 Difference]: With dead ends: 12472 [2022-07-13 23:05:34,016 INFO L226 Difference]: Without dead ends: 6296 [2022-07-13 23:05:34,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:05:34,029 INFO L413 NwaCegarLoop]: 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 [2022-07-13 23:05:34,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2169 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 23:05:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6296 states. [2022-07-13 23:05:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6296 to 6296. [2022-07-13 23:05:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6296 states, 4613 states have (on average 1.2486451333188815) internal successors, (5760), 4623 states have internal predecessors, (5760), 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) [2022-07-13 23:05:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6296 states to 6296 states and 8549 transitions. [2022-07-13 23:05:34,437 INFO L78 Accepts]: Start accepts. Automaton has 6296 states and 8549 transitions. Word has length 111 [2022-07-13 23:05:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:34,438 INFO L495 AbstractCegarLoop]: Abstraction has 6296 states and 8549 transitions. [2022-07-13 23:05:34,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-13 23:05:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6296 states and 8549 transitions. [2022-07-13 23:05:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-13 23:05:34,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:34,444 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:05:34,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-13 23:05:34,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:05:34,656 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:34,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:34,657 INFO L85 PathProgramCache]: Analyzing trace with hash -645931029, now seen corresponding path program 1 times [2022-07-13 23:05:34,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:05:34,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026531453] [2022-07-13 23:05:34,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:34,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:05:34,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:05:34,659 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) [2022-07-13 23:05:34,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-13 23:05:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:35,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 23:05:35,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:05:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 23:05:35,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:05:35,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:05:35,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026531453] [2022-07-13 23:05:35,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026531453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:05:35,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:05:35,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:05:35,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18344681] [2022-07-13 23:05:35,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:05:35,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:05:35,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:05:35,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:05:35,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:05:35,992 INFO L87 Difference]: Start difference. First operand 6296 states and 8549 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 23:05:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:38,104 INFO L93 Difference]: Finished difference Result 15428 states and 21432 transitions. [2022-07-13 23:05:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:05:38,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2022-07-13 23:05:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:38,133 INFO L225 Difference]: With dead ends: 15428 [2022-07-13 23:05:38,133 INFO L226 Difference]: Without dead ends: 9144 [2022-07-13 23:05:38,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:05:38,148 INFO L413 NwaCegarLoop]: 750 mSDtfsCounter, 177 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 23:05:38,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 2812 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 23:05:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9144 states. [2022-07-13 23:05:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9144 to 6115. [2022-07-13 23:05:38,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6115 states, 4512 states have (on average 1.2480053191489362) internal successors, (5631), 4514 states have internal predecessors, (5631), 1223 states have call successors, (1223), 334 states have call predecessors, (1223), 379 states have return successors, (1426), 1294 states have call predecessors, (1426), 1219 states have call successors, (1426) [2022-07-13 23:05:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 8280 transitions. [2022-07-13 23:05:38,761 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 8280 transitions. Word has length 124 [2022-07-13 23:05:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:38,762 INFO L495 AbstractCegarLoop]: Abstraction has 6115 states and 8280 transitions. [2022-07-13 23:05:38,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 23:05:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 8280 transitions. [2022-07-13 23:05:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-13 23:05:38,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:38,766 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:05:38,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-13 23:05:38,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:05:38,987 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash -61836419, now seen corresponding path program 1 times [2022-07-13 23:05:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:05:38,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59828486] [2022-07-13 23:05:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:38,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:05:38,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:05:38,990 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 23:05:38,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-13 23:05:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:39,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 23:05:39,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:05:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 23:05:41,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:05:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 23:05:42,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:05:42,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59828486] [2022-07-13 23:05:42,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59828486] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:05:42,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:05:42,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2022-07-13 23:05:42,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342728031] [2022-07-13 23:05:42,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:05:42,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 23:05:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:05:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 23:05:42,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:05:42,514 INFO L87 Difference]: Start difference. First operand 6115 states and 8280 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 10 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-13 23:05:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:46,254 INFO L93 Difference]: Finished difference Result 15747 states and 21947 transitions. [2022-07-13 23:05:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 23:05:46,255 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 10 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18) Word has length 122 [2022-07-13 23:05:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:46,278 INFO L225 Difference]: With dead ends: 15747 [2022-07-13 23:05:46,278 INFO L226 Difference]: Without dead ends: 9644 [2022-07-13 23:05:46,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:05:46,290 INFO L413 NwaCegarLoop]: 782 mSDtfsCounter, 232 mSDsluCounter, 8238 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 9020 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:05:46,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 9020 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-13 23:05:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9644 states. [2022-07-13 23:05:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9644 to 6103. [2022-07-13 23:05:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6103 states, 4500 states have (on average 1.2486666666666666) internal successors, (5619), 4514 states have internal predecessors, (5619), 1223 states have call successors, (1223), 334 states have call predecessors, (1223), 379 states have return successors, (1402), 1282 states have call predecessors, (1402), 1219 states have call successors, (1402) [2022-07-13 23:05:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6103 states to 6103 states and 8244 transitions. [2022-07-13 23:05:46,718 INFO L78 Accepts]: Start accepts. Automaton has 6103 states and 8244 transitions. Word has length 122 [2022-07-13 23:05:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:46,719 INFO L495 AbstractCegarLoop]: Abstraction has 6103 states and 8244 transitions. [2022-07-13 23:05:46,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 10 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-13 23:05:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6103 states and 8244 transitions. [2022-07-13 23:05:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 23:05:46,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:46,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:05:46,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-13 23:05:46,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:05:46,938 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:46,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1117139730, now seen corresponding path program 1 times [2022-07-13 23:05:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:05:46,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960064171] [2022-07-13 23:05:46,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:46,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:05:46,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:05:46,941 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 23:05:46,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-13 23:05:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 23:05:54,340 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 23:06:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 23:06:01,432 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-13 23:06:01,443 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 23:06:01,444 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 23:06:01,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-13 23:06:01,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 23:06:01,660 INFO L356 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, 1, 1] [2022-07-13 23:06:01,663 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 23:06:01,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:06:01 BoogieIcfgContainer [2022-07-13 23:06:01,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 23:06:01,771 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 23:06:01,771 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 23:06:01,771 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 23:06:01,772 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:03:47" (3/4) ... [2022-07-13 23:06:01,774 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 23:06:01,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 23:06:01,774 INFO L158 Benchmark]: Toolchain (without parser) took 147864.24ms. Allocated memory was 54.5MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 24.5MB in the beginning and 756.3MB in the end (delta: -731.8MB). Peak memory consumption was 326.2MB. Max. memory is 16.1GB. [2022-07-13 23:06:01,774 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.0MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 23:06:01,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1594.33ms. Allocated memory was 54.5MB in the beginning and 163.6MB in the end (delta: 109.1MB). Free memory was 24.4MB in the beginning and 118.7MB in the end (delta: -94.3MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2022-07-13 23:06:01,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.66ms. Allocated memory is still 163.6MB. Free memory was 118.7MB in the beginning and 109.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 23:06:01,775 INFO L158 Benchmark]: Boogie Preprocessor took 115.25ms. Allocated memory is still 163.6MB. Free memory was 109.3MB in the beginning and 98.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 23:06:01,775 INFO L158 Benchmark]: RCFGBuilder took 12096.90ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 98.8MB in the beginning and 133.9MB in the end (delta: -35.1MB). Peak memory consumption was 84.9MB. Max. memory is 16.1GB. [2022-07-13 23:06:01,776 INFO L158 Benchmark]: TraceAbstraction took 133922.83ms. Allocated memory was 222.3MB in the beginning and 1.1GB in the end (delta: 891.3MB). Free memory was 132.8MB in the beginning and 756.3MB in the end (delta: -623.5MB). Peak memory consumption was 266.8MB. Max. memory is 16.1GB. [2022-07-13 23:06:01,776 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 1.1GB. Free memory is still 756.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 23:06:01,777 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.17ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.0MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1594.33ms. Allocated memory was 54.5MB in the beginning and 163.6MB in the end (delta: 109.1MB). Free memory was 24.4MB in the beginning and 118.7MB in the end (delta: -94.3MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.66ms. Allocated memory is still 163.6MB. Free memory was 118.7MB in the beginning and 109.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.25ms. Allocated memory is still 163.6MB. Free memory was 109.3MB in the beginning and 98.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 12096.90ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 98.8MB in the beginning and 133.9MB in the end (delta: -35.1MB). Peak memory consumption was 84.9MB. Max. memory is 16.1GB. * TraceAbstraction took 133922.83ms. Allocated memory was 222.3MB in the beginning and 1.1GB in the end (delta: 891.3MB). Free memory was 132.8MB in the beginning and 756.3MB in the end (delta: -623.5MB). Peak memory consumption was 266.8MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 1.1GB. Free memory is still 756.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of 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={0:0}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}, skb->len=13] [L5257] COND FALSE !((unsigned long )skb->len != sizeof(*cf)) [L5260] EXPR cf->can_dlc VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, cf->can_dlc=0, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}] [L5260] COND FALSE !((int const )cf->can_dlc > 8) [L5263] tmp___7 = 0 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}, tmp___7=0] [L5266] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}, tmp___7=0, tmp___8=0] [L5268] COND FALSE !(\read(tmp___8)) [L5276] return (0); VAL [\result=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:0}, skb={0:0}, tmp___7=0, tmp___8=0] [L6072] RET, EXPR can_dropped_invalid_skb(netdev, skb) [L6072] tmp___8 = can_dropped_invalid_skb(netdev, skb) [L6074] COND FALSE !(\read(tmp___8)) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0] [L6079] CALL, EXPR usb_alloc_urb(0, 32U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6830] void *arbitrary_memory ; [L6831] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6834] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6837] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, \old(size)=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={77: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()={77: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={77: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={77: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={77:0}, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, arbitrary_memory={77: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={77:0}] [L6079] RET, EXPR usb_alloc_urb(0, 32U) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, usb_alloc_urb(0, 32U)={77:0}] [L6079] urb = usb_alloc_urb(0, 32U) [L6081] COND FALSE !(! urb) [L6089] EXPR dev->udev VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, context={0:0}, dev={0:-520}, dev->udev={0:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, urb={77: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={77: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={77:104}, dma={77: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={77:104}, dma={77: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)={50: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={77:104}, dma={77: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()={50: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={50:0}, dev={0:0}, dev={0:0}, dma={77:104}, dma={77: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={50: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={50:0}, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, arbitrary_memory={50:0}, dev={0:0}, dev={0:0}, dma={77:104}, dma={77: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={50:0}] [L6089] RET, EXPR usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, cf={0:0}, context={0:0}, dev={0:-520}, dev->udev={0:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, urb={77:0}, usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma)={50: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={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={0:0}, skb={0:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={50:0}, urb={77: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={50:0}, cf={0:0}, cf->can_id=-1073741824, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77: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={50:0}, cf={0:0}, cf->can_id=-1073741824, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77: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={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77:0}] [L6109] msg->length = (u8 )5 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77: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={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77:0}] [L6135] COND TRUE 1 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77:0}] [L6137] COND TRUE i < 10 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77:0}] [L6141] EXPR dev->tx_contexts[i].echo_index VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, dev->tx_contexts[i].echo_index=10, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77: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={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77:0}] [L6151] COND TRUE ! context VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77:0}] [L6153] FCALL usb_unanchor_urb(urb) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77:0}] [L6154] EXPR dev->udev [L6154] EXPR urb->transfer_dma VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, buf={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, dev->udev={0:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77: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={50: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={50:0}, addr={50: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={50:0}, addr={50: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={50:0}, addr={50: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={50:0}, addr={50: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={50:0}, addr={50: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={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, dev->udev={0:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77: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={50:0}, cf={0:0}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, msg={50: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={50:0}, urb={77: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: 133.8s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 74.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 8268 SdHoareTripleChecker+Valid, 65.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7271 mSDsluCounter, 96044 SdHoareTripleChecker+Invalid, 62.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75950 mSDsCounter, 1158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4274 IncrementalHoareTripleChecker+Invalid, 5444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1158 mSolverCounterUnsat, 20094 mSDtfsCounter, 4274 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2898 GetRequests, 2752 SyntacticMatches, 2 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6296occurred in iteration=26, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 26985 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 15.3s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 2499 NumberOfCodeBlocks, 2477 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2871 ConstructedInterpolants, 0 QuantifiedInterpolants, 4296 SizeOfPredicates, 44 NumberOfNonLiveVariables, 22748 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 33 InterpolantComputations, 24 PerfectInterpolantSequences, 300/334 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 23:06:01,865 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample